A new accuracy criterion for approximate proximal point algorithms

Journal of Mathematical Analysis and Applications

Volumn 263, Issue 2, 2001, Pages 343-354

  Han, Deren ^a   He, Bingsheng ^a  

^a NANJING UNIVERSITY   (China)

Author keywords

Inexact methods; Monotone operators; Proximal point algorithms

Indexed keywords

EID: 0035891519     PISSN: 0022247X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jmaa.2001.7535     Document Type: Article

References (24)

1. Note on the topological degree of the subdifferential of a lower semi-continuous convex function
2. "Opérateurs Maximaux Monotone et Semi-Groups de Contractions dans les Espaces de Hilbert"
3. Enlargement of monotone operators with applications to variational inequalities
4. The proximal minimization algorithm with D-functions
5. A proximal-based decomposition method for convex minimization problems
6. A generalization of the zero point theorem of maximal monotone mappings
7. Auxiliary problem principle and decomposition of optimization problems
8. Auxiliary problem principle extended to variational inequalities
9. Inexact Newton methods
10. Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming
11. On the Douglas-Rachford splitting method and the proximal points algorithm for maximal monotone operators
12. Approximate iterations in Bregman-function-based proximal algorithms
13. Inexact implicit methods for monotone general variational inequalities
14. Multiplier and gradient methods
15. Proximal minimization methods with generalized Bregman functions
16. Nonlinear proximal decomposition method for convex programming
17. Inexact Newton methods for the nonlinear complementarity problem
18. Monotone operators and the proximal point algorithm
19. A hybrid projection-proximal point algorithm
20. A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
21. An inexact hybrid generalized proximal point algorithm and some new result on the theory of Bregman functions
22. Convergence of proximal-like algorithms