Convergence of a Proximal Point Method in the Presence of Computational Errors in Hilbert Spaces
From MaRDI portal
Publication:3083292
DOI10.1137/090766930zbMath1208.49042MaRDI QIDQ3083292
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
90C25: Convex programming
90C30: Nonlinear programming
49M37: Numerical methods based on nonlinear programming
Related Items
A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors, Perturbation resilience of proximal gradient algorithm for composite objectives, Global convergence of a proximal linearized algorithm for difference of convex functions, 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, Inexact proximal point methods in metric spaces, 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 telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption, Convergence rates of accelerated proximal gradient algorithms under independent noise
