Convergence of generalized proximal point algorithms
By Giuseppe Marino, Hong-Kun Xu. 2004
173 citations recorded by the source corpus.
Weak and strong convergence for some generalized proximal point algorithms are proved. These algorithms include the Eckstein and Bertsekas generalized proximal point algorithm, a contraction-proximal point algorithm, and inexact proximal point algorithms. Convergence rate is also considered.
Subfields: Computational Theory and Mathematics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/56b8a4beb873b744bb251d7ed7ce356c1510c226
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Giuseppe Marino
- Hong-Kun Xu
- Jen-Chih Yao
- Yongfu Su
- Xiaolong Qin
- Fenghui Wang
- Yonghong Yao
- Haiyun Zhou
In Geometry and Topology
- Giuseppe Marino
- Hong-Kun Xu
- Jen-Chih Yao
- Yongfu Su
- Xiaolong Qin
- Haiyun Zhou
- Yonghong Yao
- Meijuan Shang
Citations in the corpus
- WEAK AND STRONG CONVERGENCE THEOREMS FOR STRICT PSEUDO-CONTRACTIONS IN HILBERT SPACES (2007, result): “Related strong convergence results appeared also in the articles [10–12,15–17,23,24,30].”