论文信息 - A Relaxed Approximate Proximal Point Algorithm

A Relaxed Approximate Proximal Point Algorithm

Abstract For a maximal monotone operator T, a well-known overrelaxed point algorithm is often used to find the zeros of T. In this paper, we enhance the algorithm to find a point in $T^{-1}(0)\cap \mathcal{X}$ , where $\mathcal{X}$ is a given closed convex set. In the inexact case of our modified relaxed proximal point algorithm, we give a new criterion. The convergence analysis is quite easy to follow.

Bingsheng He | Zhenhua Yang | B. He | Zhenhua Yang

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

[2] A. Iusem,et al. Enlargement of Monotone Operators with Applications to Variational Inequalities , 1997 .

[3] M. Hestenes. Multiplier and gradient methods , 1969 .

[4] Bingsheng He,et al. Inexact implicit methods for monotone general variational inequalities , 1999, Math. Program..

[5] Jonathan Eckstein,et al. Approximate iterations in Bregman-function-based proximal algorithms , 1998, Math. Program..

[6] Michael C. Ferris,et al. Engineering and Economic Applications of Complementarity Problems , 1997, SIAM Rev..

[7] R. Glowinski. Lectures on Numerical Methods for Non-Linear Variational Problems , 1981 .

[8] Jonathan Eckstein,et al. Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming , 1993, Math. Oper. Res..

[9] H. Brezis. Opérateurs maximaux monotones et semi-groupes de contractions dans les espaces de Hilbert , 1973 .

[10] B. He,et al. A new accuracy criterion for approximate proximal point algorithms , 2001 .

[11] Dimitri P. Bertsekas,et al. On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators , 1992, Math. Program..