Convergence of a proximal-like algorithm in the presence of computational errors
From MaRDI portal
Publication:536466
DOI10.11650/twjm/1500406077zbMath1237.49043OpenAlexW1590865130MaRDI QIDQ536466
Publication date: 18 May 2011
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/twjm/1500406077
Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items (3)
A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors ⋮ Re-examination of Bregman functions and new properties of their divergences ⋮ Inexact proximal point methods in metric spaces
This page was built for publication: Convergence of a proximal-like algorithm in the presence of computational errors
