The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors

DOI10.1080/01630563.2010.489248zbMath1196.49028OpenAlexW2140018151MaRDI QIDQ3590034

Zaslavski, Alexander J.

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

zbMATH Keywords

constrained optimizationHilbert spaceconvex functionprojected subgradient method

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (4)

The extragradient method for solving variational inequalities in the presence of computational errors ⋮ An infeasible-point subgradient method using adaptive approximate projections ⋮ The Extragradient Method for Convex Optimization in the Presence of Computational Errors ⋮ Inexact proximal point methods in metric spaces

Cites Work

• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors