Convergence of a Proximal Point Method in the Presence of Computational Errors in Hilbert Spaces

DOI10.1137/090766930zbMath1208.49042OpenAlexW2094097069MaRDI QIDQ3083292

Zaslavski, Alexander J.

Publication date: 21 March 2011

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090766930

zbMATH Keywords

Hilbert spaceconvex programmingsubdifferentialproximal method

Mathematics Subject Classification ID

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

Related Items (10)

Global convergence of a proximal linearized algorithm for difference of convex functions ⋮ A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem ⋮ Inexact first-order primal-dual algorithms ⋮ A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors ⋮ Convergence rates of accelerated proximal gradient algorithms under independent noise ⋮ The extragradient method for solving variational inequalities in the presence of computational errors ⋮ A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors ⋮ Perturbation resilience of proximal gradient algorithm for composite objectives ⋮ Inexact proximal point methods in metric spaces ⋮ A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption

This page was built for publication: Convergence of a Proximal Point Method in the Presence of Computational Errors in Hilbert Spaces