The contraction-proximal point algorithm with square-summable errors
DOI10.1186/1687-1812-2013-93zbMATH Open1423.47050OpenAlexW2105148926WikidataQ59301590 ScholiaQ59301590MaRDI QIDQ2249126FDOQ2249126
Authors: Chang-An Tian, Fenghui Wang
Publication date: 8 July 2014
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1687-1812-2013-93
Recommendations
- The generalized contraction proximal point algorithm with square-summable errors
- Error sensitivity for strongly convergent modifications of the proximal point algorithm
- A contraction proximal point algorithm with two monotone operators
- On the contraction-proximal point algorithms with multi-parameters
- Convergence of a proximal point algorithm for maximal monotone operators in Hilbert spaces
Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Variational inequalities (49J40) Numerical solutions to equations with nonlinear operators (65J15)
Cites Work
- Convex analysis and monotone operator theory in Hilbert spaces
- Forcing strong convergence of proximal point iterations in a Hilbert space
- Monotone Operators and the Proximal Point Algorithm
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Approximating solutions of maximal monotone operators in Hilbert spaces
- On the contraction-proximal point algorithms with multi-parameters
- Iterative Algorithms for Nonlinear Operators
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- A regularization method for the proximal point algorithm
- New accuracy criteria for modified approximate proximal point algorithms in Hilbert spaces
- Convergence of generalized proximal point algorithms
- A note on the regularized proximal point algorithm
- A new accuracy criterion for approximate proximal point algorithms
- A proximal point algorithm converging strongly for general errors
- Four parameter proximal point algorithms
Cited In (13)
- The viscosity approximation forward-backward splitting method for zeros of the sum of monotone operators
- Error sensitivity for strongly convergent modifications of the proximal point algorithm
- On weak and strong convergence results for generalized equilibrium variational inclusion problems in Hilbert spaces
- Explicit iterative methods for maximal monotone operators in Hilbert spaces
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy
- A generalized contraction proximal point algorithm with two monotone operators
- The generalized contraction proximal point algorithm with square-summable errors
- Approximating common fixed points of Bregman weakly relatively nonexpansive mappings in Banach spaces
- On the contraction-proximal point algorithms with multi-parameters
- Convergence of over-relaxed contraction-proximal point algorithm in Hilbert spaces
- A connection between Chidume iteration and the contraction-proximal point algorithm
- Contraction of the proximal mapping and applications to the equilibrium problem
- Forward-backward splitting algorithm for fixed point problems and zeros of the sum of monotone operators
This page was built for publication: The contraction-proximal point algorithm with square-summable errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249126)