A unified framework for some inexact proximal point algorithms

Numerical Functional Analysis and Optimization

Volumn 22, Issue 7-8, 2001, Pages 1013-1035

  Solodov, M V ^a   Svaiter, B F ^a  

^a IMPA   (Brazil)

Author keywords

Approximation criteria; Maximal monotone operator; Proximal point algorithm

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; ERROR ANALYSIS; ITERATIVE METHODS; MATHEMATICAL OPERATORS; PROBLEM SOLVING; SET THEORY;

PROXIMAL POINT ALGORITHMS;

APPROXIMATION THEORY;

EID: 0035518990     PISSN: 01630563     EISSN: None     Source Type: Journal    
DOI: 10.1081/NFA-100108320     Document Type: Article

References (46)

1. A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces
2. An iterative solution of a variational inequality for certain monotone operators in a Hilbert space
3. Enlargement of monotone operators with applications to variational inequalities
4. Bundle methods for maximal monotone operators
5. ε-enlargements of maximal monotone operators: Theory and applications
6. ε-enlargements of maximal monotone operators in Banach spaces
7. A variable metric proximal point algorithm for monotone operators
8. Coupling the proximal point algorithm with approximation methods
9. Inexact Newton methods
10. Approximate iterations in Bregman-function-based proximal algorithms
11. Complementarity and related problems
12. Solution of monotone complementarity problems with locally Lipschitzian functions
13. Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
14. Applications of the method of multipliers to variational inequalities
15. On the convergence of the proximal point algorithm for convex minimization
16. Solving box constrained variational inequality problems by using the natural residual with D-gap function globalization
17. The proximal algorithm
18. A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
19. Semismooth and semiconvex functions in constrained optimization
20. Weak convergence of the sequence of successive approximations for nonexpansive mappings
21. Inexact Newton methods for the nonlinear complementarity problem
22. Complementarity problems
23. NE/SQP: A robust algorithm for the nonlinear complementarity problem
24. Nonsmooth equations: Motivation and algorithms
25. Convergence analysis of some algorithms for solving nonsmooth equations
26. A nonsmooth version of Newton's method
27. Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
28. Monotone operators and the proximal point algorithm
29. On the relation between bundle methods for maximal monotone inclusions and hybrid proximal point algorithms
30. Méthodes itératives pour les équations et inéquations aux dérivées partielles nonlinéares de type monotone
31. A new projection method for variational inequality problems
32. A truly globally convergent Newton-type method for the monotone nonlinear complementarity problem
33. A globally convergent inexact Newton method for systems of monotone equations
34. A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
35. A hybrid projection-proximal point algorithm
36. Error bounds for proximal point subproblems and associated inexact proximal point algorithms
37. Forcing strong convergence of proximal point iterations in a Hilbert space
38. An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
39. The perturbed proximal point algorithm and some of its applications
40. Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
41. A modified forward-backward splitting method for maximal monotone mappings
42. Monotonicity of fixed point and normal mappings associated with variational inequality and its application
43. Co-coercivity and its role in the convergence of iterative schemes for solving variational inequalities