A proximal point algorithm revisited and extended
From MaRDI portal
Publication:2322372
DOI10.1007/S10957-019-01536-5OpenAlexW2951180569WikidataQ127845590 ScholiaQ127845590MaRDI QIDQ2322372
Adrian Petruşel, Gheorghe Morosanu
Publication date: 4 September 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.04051
Convex programming (90C25) Applications of mathematical programming (90C90) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong convergence of two proximal point algorithms with possible unbounded error sequences
- A regularization method for the proximal point algorithm
- A strongly convergent iterative solution of \(0 \in U(x)\) for a maximal monotone operator U in Hilbert space
- On the contraction-proximal point algorithms with multi-parameters
- Strong convergence of a proximal point algorithm with bounded error sequence
- 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
This page was built for publication: A proximal point algorithm revisited and extended