Error sensitivity for strongly convergent modifications of the proximal point algorithm
DOI10.1007/s10957-015-0835-4zbMath1345.47052OpenAlexW1939526422MaRDI QIDQ283935
Hong-Kun Xu, Yamin Wang, Feng Hui Wang
Publication date: 17 May 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-015-0835-4
resolventstrong convergencemaximal monotone operatorproximal point algorithmcontraction-proximal point algorithm
Convex programming (90C25) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Numerical methods for variational inequalities and related problems (65K15)
Related Items
Cites Work
- Unnamed Item
- A note on the regularized proximal point algorithm
- A proximal point algorithm converging strongly for general errors
- Four parameter proximal point algorithms
- A regularization method for the proximal point algorithm
- On convergence criteria of generalized proximal point algorithms
- New accuracy criteria for modified approximate proximal point algorithms in Hilbert spaces
- Approximate iterations in Bregman-function-based proximal algorithms
- Convergence of generalized proximal point algorithms
- Approximating solutions of maximal monotone operators in Hilbert spaces
- On the contraction-proximal point algorithms with multi-parameters
- Forcing strong convergence of proximal point iterations in a Hilbert space
- The contraction-proximal point algorithm with square-summable errors
- Iterative Algorithms for Nonlinear Operators
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Strong Convergence of a Proximal-Type Algorithm in a Banach Space
- A new accuracy criterion for approximate proximal point algorithms
This page was built for publication: Error sensitivity for strongly convergent modifications of the proximal point algorithm