Error sensitivity for strongly convergent modifications of the proximal point algorithm
DOI10.1007/S10957-015-0835-4zbMATH Open1345.47052OpenAlexW1939526422MaRDI QIDQ283935FDOQ283935
Authors: Yamin Wang, Hong-Kun Xu, Fenghui 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
Recommendations
- Strong convergence of two proximal point algorithms with possible unbounded error sequences
- A proximal point algorithm converging strongly for general errors
- On the proximal point algorithm for strongly monotone operators
- Strong convergence of a proximal point algorithm with general errors
- The contraction-proximal point algorithm with square-summable errors
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)
Cites Work
- Forcing strong convergence of proximal point iterations in a Hilbert space
- Title not available (Why is that?)
- Monotone Operators and the Proximal Point Algorithm
- Approximate iterations in Bregman-function-based proximal algorithms
- 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
- Strong Convergence of a Proximal-Type Algorithm in a Banach Space
- 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
- The contraction-proximal point algorithm with square-summable errors
- 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
- On convergence criteria of generalized proximal point algorithms
Cited In (18)
- On the intermixed method for mixed variational inequality problems: another look and some corrections
- The split feasibility problem with multiple output sets for demicontractive mappings
- On a new iterative method for solving equilibrium problems and fixed point problems
- Strong convergence of the forward–backward splitting method with multiple parameters in Hilbert spaces
- Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization
- A proximal point algorithm converging strongly for general errors
- Four parameter proximal point algorithms
- Strong convergence of regularized new proximal point algorithms
- Explicit iterative methods for maximal monotone operators in Hilbert spaces
- On the proximal point algorithm for strongly monotone operators
- Strong convergence of a proximal point algorithm with general errors
- A generalized contraction proximal point algorithm with two monotone operators
- Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing
- Quantitative results on a Halpern-type proximal point algorithm
- Convergence of over-relaxed contraction-proximal point algorithm in Hilbert spaces
- The contraction-proximal point algorithm with square-summable errors
- Strong convergence of two proximal point algorithms with possible unbounded error sequences
- Strong convergence of proximal point algorithm with inertial terms and errors
This page was built for publication: Error sensitivity for strongly convergent modifications of the proximal point algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283935)
