Strong convergence of two proximal point algorithms with possible unbounded error sequences
DOI10.1007/S10957-016-1028-5zbMath1382.47020OpenAlexW2535617085MaRDI QIDQ511971
Sirous Moradi, Behzad Djafari Rouhani
Publication date: 23 February 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-1028-5
strong convergenceHilbert spacemaximal monotone operatorresolvent operatormetric projectionproximal point algorithmzero set
Applications of mathematical programming (90C90) Multi-objective and goal programming (90C29) Variational inequalities (49J40) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items (8)
Cites Work
- Fifty years of maximal monotonicity
- Asymptotic behaviour of almost nonexpansive sequences in a Hilbert space
- Asymptotic behaviour of quasi-autonomous dissipative systems in Hilbert spaces
- A regularization method for the proximal point algorithm
- On the proximal point algorithm
- Nonlinear analysis and variational problems. In Honor of George Isac
- A strongly convergent iterative solution of \(0 \in U(x)\) for a maximal monotone operator U in Hilbert space
- Strong convergence of a proximal point algorithm with bounded error sequence
- On the maximal monotonicity of subdifferential mappings
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Combining The Proximal Algorithm And Tikhonov Regularization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Strong convergence of two proximal point algorithms with possible unbounded error sequences