On relaxed and contraction-proximal point algorithms in Hilbert spaces
From MaRDI portal
Publication:352262
DOI10.1186/1029-242X-2011-41zbMath1267.47106WikidataQ59269218 ScholiaQ59269218MaRDI QIDQ352262
Publication date: 4 July 2013
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1029-242x-2011-41
90C25: Convex programming
47H05: Monotone operators and generalizations
47J25: Iterative procedures involving nonlinear operators
47H09: Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc.
Related Items
Cites Work
- A note on the regularized proximal point algorithm
- On convergence criteria of generalized proximal point algorithms
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- Iterative Algorithms for Nonlinear Operators
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- A new accuracy criterion for approximate proximal point algorithms