Inexact versions of proximal point and augmented Lagrangian algorithms in Banach spaces

Numerical Functional Analysis and Optimization

Volumn 22, Issue 5-6, 2001, Pages 609-640

  Iusem, A ^a   Otero, R G ^a  

^a IMPA   (Brazil)

Author keywords

Augmented Lagrangian; Bregman projection; Inexact solutions; Maximal monotone operator; Proximal point method

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; LAGRANGE MULTIPLIERS; OPTIMIZATION; SET THEORY;

BANACH SPACES; PROXIMAL POINT METHODS;

MATHEMATICAL OPERATORS;

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

References (44)

1. A proximal point method for nonsmooth convex optimization problems in Banach spaces
2. The non-existence of smooth demands in general Banach spaces
3. A logarithmic-quadratic proximal method for variational inequalities
4. Interior proximal and multiplier methods based on second order homogeneous kernels
5. On penalty and multiplier methods for constrained optimization problems
6. Nonlinear operators and nonlinear equations of evolution in Banach spaces
7. A generalized proximal point algorithm for the variational inequality problem in a Hilbert space
8. Enlargement of monotone operators with applications to variational inequalities
9. A proximal point algorithm for the variational inequality problem in Banach spaces
10. A relative error tolerance for a family of generalized proximal point methods
11. On a proximal point method for convex optimization in Banach spaces
12. Total convexity of the powers of the norm in uniformly convex Banach spaces
13. The proximal minimization algorithm with D-functions
14. Convergence analysis of a proximal-like optimization algorithm using Bregman functions
15. Auxiliary problem principle and decomposition in optimization problems
16. Auxiliary problem principle extended to variational inequalities
17. Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming
18. Rescaling and stepsize selection in proximal methods using separable generalized distances
19. Multiplier and gradient methods
20. On some properties of generalized proximal point methods for quadratic and linear programming
21. On some properties of generalized proximal point methods for variational inequalities
22. p(Ω)
23. Entropy-like proximal methods in convex programming
24. Convergence rate analysis of nonquadratic proximal and augmented Lagrangian methods for convex and linear programming
25. The proximal point algorithm for reflexive Banach spaces
26. Proximal minimization methods with generalized Bregman functions
27. Combined primal-dual and penalty methods for convex programming
28. Two observations about the method of successive approximations
29. Proximité et dualité dans un espace hilbertien
30. Method for nonlinear constraints in minimization problems
31. Monotone operators associated with saddle functions and minimax problems
32. The multiplier method of Hestenes and Powell applied to convex programming
33. Monotone operators and the proximal point algorithm
34. Augmented Lagrangians and applications of the proximal point algorithm in convex programming
35. A hybrid projection-proximal point algorithm
36. An inexact hybrid generalized proximal point algorithms and some new results on the theory of Bregman functions