The Extragradient Method for Convex Optimization in the Presence of Computational Errors

DOI10.1080/01630563.2012.706769zbMath1262.49041OpenAlexW2000091955MaRDI QIDQ4899104

Zaslavski, Alexander J.

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

zbMATH Keywords

convex optimizationHilbert spaceextragradient methodcomputational errorsapproximation bounds

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37)

Related Items (1)

Iterative Methods for the Elastography Inverse Problem of Locating Tumors

Cites Work

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

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