Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
From MaRDI portal
Publication:1005145
DOI10.1007/s11228-008-0102-zzbMath1156.90426MaRDI QIDQ1005145
Publication date: 16 March 2009
Published in: Set-Valued Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11228-008-0102-z
Related Items
A new strong convergence theorem for equilibrium problems and fixed point problems in Banach spaces, Strong convergence theorem for equilibrium problems and fixed points of a nonspreading mapping in Hilbert spaces, Strong convergence theorems by Halpern-Mann iterations for relatively nonexpansive mappings in Banach spaces, A Halpern-Mann type iteration for fixed point problems of a relatively nonexpansive mapping and a system of equilibrium problems, Projected subgradient techniques and viscosity methods for optimization with variational inequality constraints, The viscosity approximation process for quasi-nonexpansive mappings in Hilbert spaces, Halpern-type iterations for strongly relatively nonexpansive mappings in Banach spaces, The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence properties of the projected gradient method for convex optimization
- Strong convergence theorem by an extragradient method for fixed point problems and variational inequality problems
- Error stability properties of generalized gradient-type algorithms
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Convergence of some algorithms for convex minimization
- The gradient projection method with exact line search
- Viscosity approximation methods for fixed-points problems
- Application Of Khobotov’s Algorithm To Variational Inequalities And Network Equilibrium Problems
- Projection methods for variational inequalities with application to the traffic assignment problem
- On the Goldstein-Levitin-Polyak gradient projection method
- A New Projection Method for Variational Inequality Problems
- Iterative oblique projection onto convex sets and the split feasibility problem
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Strong Convergence Theorem by a Hybrid Method for Nonexpansive Mappings and Lipschitz-Continuous Monotone Mappings
- Fixed points of nonexpanding maps
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Extension of subgradient techniques for nonsmooth optimization in Banach spaces
