On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
From MaRDI portal
(Redirected from Publication:1290597)
Recommendations
- Spectral projected subgradient method for nonsmooth convex optimization problems
- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
- Nonsmooth steepest descent method by proximal subdifferentials in Hilbert spaces
- The subgradient double projection method for variational inequalities in a Hilbert space
- The projected subgradient algorithm in convex optimization
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints†
- The projected subgradient method for nonsmooth convex optimization in the presence of computational errors
- Projected viscosity subgradient methods for variational inequalities with equilibrium problem constraints in Hilbert spaces
- scientific article; zbMATH DE number 11412
Cites work
- scientific article; zbMATH DE number 3846336 (Why is no real title available?)
- scientific article; zbMATH DE number 4208167 (Why is no real title available?)
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 3972625 (Why is no real title available?)
- scientific article; zbMATH DE number 3764512 (Why is no real title available?)
- scientific article; zbMATH DE number 1130733 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- Convergence of some algorithms for convex minimization
- Convergence of the steepest descent method for minimizing quasiconvex functions
- Entropy-Like Proximal Methods in Convex Programming
- Error stability properties of generalized gradient-type algorithms
- Full convergence of the steepest descent method with inexact line searches
- On the Subdifferentiability of Convex Functions
- The stabilizing properties of the gradient method
Cited in
(88)- Path-based incremental target level algorithm on Riemannian manifolds
- Projected stochastic gradients for convex constrained problems in Hilbert spaces
- On the forward-backward method with nonmonotone linesearch for infinite-dimensional nonsmooth nonconvex problems
- An inexact nonmonotone projected gradient method for constrained multiobjective optimization
- Spectral projected subgradient method for nonsmooth convex optimization problems
- Inexact and stochastic generalized conditional gradient with augmented Lagrangian and proximal step
- On convergence of binary trust-region steepest descent
- A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
- A new self-adaptive CQ algorithm with an application to the LASSO problem
- Subgradient method for convex feasibility on Riemannian manifolds
- Projected subgradient method for non-Lipschitz set-valued mixed variational inequalities
- Level bundle-like algorithms for convex optimization
- A relative inexact proximal gradient method with an explicit linesearch
- Strong convergence of projected subgradient methods in infinite-dimensional Hilbert spaces
- Tseng-type splitting projection algorithms for equilibrium problems in Hilbert spaces
- On the convergence of conditional -subgradient methods for convex programs and convex-concave saddle-point problems.
- An interior projected-like subgradient method for mixed variational inequalities
- A subgradient method for multiobjective optimization on Riemannian manifolds
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Convergence of direct methods for paramonotone variational inequalities
- Projected subgradient techniques and viscosity methods for optimization with variational inequality constraints
- Learning Multiple Quantiles With Neural Networks
- A projected subgradient method for solving generalized mixed variational inequalities
- scientific article; zbMATH DE number 2196506 (Why is no real title available?)
- Subgradient method for minimization of convex functionals and some efficiency bounds
- Self-adaptive gradient projection algorithms for variational inequalities involving non-Lipschitz continuous operators
- A projection subgradient method for solving optimization with variational inequality constraints
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- An incremental subgradient method on Riemannian manifolds
- The extragradient method for solving variational inequalities in the presence of computational errors
- Iterative thresholding meets free-discontinuity problems
- A branch-and-bound algorithm for parametric mixed-binary nonlinear programs
- Subgradient algorithms for solving variable inequalities
- Subgradient method with feasible inexact projections for constrained convex optimization problems
- Distributed optimization with inexact oracle
- A subgradient-like algorithm for solving vector convex inequalities
- scientific article; zbMATH DE number 11412 (Why is no real title available?)
- A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
- Proximal algorithms for a class of abstract convex functions
- A direct splitting method for nonsmooth variational inequalities
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
- Almost sure convergence rates of stochastic proximal gradient descent algorithm
- Nonsmooth nonconvex global optimization in a Banach space with a basis
- On average convergence of the iterative projection methods
- Evolution differential inclusion with projection for solving constrained nonsmooth convex optimization in Hilbert space
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach
- A weighting subgradient algorithm for multiobjective optimization
- Continuous gradient projection method in Hilbert spaces
- Modified basic projection methods for a class of equilibrium problems
- Convex cardinal shape composition
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- An infeasible-point subgradient method using adaptive approximate projections
- Convergence of a projected gradient method variant for quasiconvex objectives
- A proximal-Newton method for unconstrained convex optimization in Hilbert spaces
- The approximation algorithm for solving a sort of non-smooth programming
- Auxiliary principle and iterative algorithms for Lions-Stampacchia variational inequalities
- Incremental subgradient methods for nondifferentiable optimization in a Hilbert space
- A relaxed projection method for solving multiobjective optimization problems
- A proximal point method for quasi-equilibrium problems in Hilbert spaces
- Nonsmooth steepest descent method by proximal subdifferentials in Hilbert spaces
- Generalized conditional gradient with augmented Lagrangian for composite minimization
- Sub-linear convergence of a stochastic proximal iteration method in Hilbert space
- Nonlocal p-Laplacian evolution problems on graphs
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
- The projected subgradient method for nonsmooth convex optimization in the presence of computational errors
- Accelerated projected gradient method for linear inverse problems with sparsity constraints
- An additive subfamily of enlargements of a maximally monotone operator
- An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
- Error stability properties of generalized gradient-type algorithms
- A strongly convergent method for nonsmooth convex minimization in Hilbert spaces
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
- A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method
- On subgradient projectors
- Two-stage stochastic variational inequality arising from stochastic programming
- Modified Fejér sequences and applications
- A computational study of a class of recursive inequalities
- A viscosity method with no spectral radius requirements for the split common fixed point problem
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
- Finite termination of inexact proximal point algorithms in Hilbert spaces
- Convergence of the projection and contraction methods for solving bilevel variational inequality problems
- A proximal gradient method with an explicit line search for multiobjective optimization
- Convergence of one-step projection methods for equilibrium problems given by a sum of two bifunctions
- Primal-dual -subgradient method for distributed optimization
- Scaling techniques for -subgradient methods
- Revisiting subgradient method: complexity and convergence beyond Lipschitz continuity
- Projected viscosity subgradient methods for variational inequalities with equilibrium problem constraints in Hilbert spaces
- Adapted total variation for artifact free decompression of JPEG images
- Convergence analysis of incremental and parallel line search subgradient methods in Hilbert space
This page was built for publication: On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290597)
