The Extragradient Method for Convex Optimization in the Presence of Computational Errors
From MaRDI portal
Publication:4899104
DOI10.1080/01630563.2012.706769zbMath1262.49041MaRDI QIDQ4899104
Publication date: 4 January 2013
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2012.706769
convex optimization; Hilbert space; extragradient method; computational errors; approximation bounds
90C25: Convex programming
90C30: Nonlinear programming
65K10: Numerical optimization and variational techniques
49M37: Numerical methods based on nonlinear programming
Related Items
Cites Work
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Error stability properties of generalized gradient-type algorithms
- The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors
- 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