The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors
From MaRDI portal
Publication:3590034
DOI10.1080/01630563.2010.489248zbMath1196.49028MaRDI QIDQ3590034
Publication date: 17 September 2010
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2010.489248
90C25: Convex programming
90C30: Nonlinear programming
49M37: Numerical methods based on nonlinear programming
Related Items
The Extragradient Method for Convex Optimization in the Presence of Computational Errors, The extragradient method for solving variational inequalities in the presence of computational errors, An infeasible-point subgradient method using adaptive approximate projections, Inexact proximal point methods in metric spaces
Cites Work
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Error stability properties of generalized gradient-type algorithms
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Full convergence of the steepest descent method with inexact line searches
- Hilbert-Valued Perturbed Subgradient Algorithms
- Unnamed Item
- Unnamed Item