A proximal point method involving two resolvent operators
From MaRDI portal
Publication:1925451
DOI10.1155/2012/892980zbMath1253.65095WikidataQ58697031 ScholiaQ58697031MaRDI QIDQ1925451
Publication date: 18 December 2012
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/892980
65K05: Numerical mathematical programming methods
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the regularized proximal point algorithm
- A proximal point algorithm converging strongly for general errors
- Four parameter proximal point algorithms
- Inexact Halpern-type proximal point algorithm
- Strong convergence of a proximal point algorithm with general errors
- The asymptotic behavior of the composition of two resolvents
- A regularization method for the proximal point algorithm
- On convergence criteria of generalized proximal point algorithms
- A new iterative algorithm for common solutions of a finite family of accretive operators
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- A note on a paper ``A regularization method for the proximal point algorithm
- Projection and proximal point methods: Convergence results and counterexamples.
- Convergence of generalized proximal point algorithms
- Approximating solutions of maximal monotone operators in Hilbert spaces
- An alternating projection that does not converge in norm
- On the contraction-proximal point algorithms with multi-parameters
- Iterative Algorithms for Nonlinear Operators
- Combining The Proximal Algorithm And Tikhonov Regularization