论文信息 - A note on the regularized proximal point algorithm

A note on the regularized proximal point algorithm

Recently, Xu (J Glob Optim 36:115–125 (2006)) introduced a regularized proximal point algorithm for approximating a zero of a maximal monotone operator. In this note, we shall prove the strong convergence of this algorithm under some weaker conditions.

Fenghui Wang | Fenghui Wang

[1] Hong-Kun Xu,et al. A Regularization Method for the Proximal Point Algorithm , 2006, J. Glob. Optim..

[2] Benar Fux Svaiter,et al. Forcing strong convergence of proximal point iterations in a Hilbert space , 2000, Math. Program..

[3] Yisheng Song,et al. A note on a paper “A regularization method for the proximal point algorithm” , 2009, J. Glob. Optim..

[4] Huanhuan Cui,et al. On the contraction-proximal point algorithms with multi-parameters , 2012, J. Glob. Optim..

[5] Osman Güer. On the convergence of the proximal point algorithm for convex minimization , 1991 .

[6] Tomonari Suzuki,et al. A sufficient and necessary condition for Halpern-type strong convergence to fixed points of nonexpansive mappings , 2006 .

[7] W. A. Kirk,et al. Topics in Metric Fixed Point Theory , 1990 .

[8] Hong-Kun Xu. Iterative Algorithms for Nonlinear Operators , 2002 .

[9] A. Moudafi,et al. Combining The Proximal Algorithm And Tikhonov Regularization , 1996 .

[10] R. Rockafellar. Monotone Operators and the Proximal Point Algorithm , 1976 .

[11] Heinz H. Bauschke,et al. A Weak-to-Strong Convergence Principle for Fejé-Monotone Methods in Hilbert Spaces , 2001, Math. Oper. Res..