A relative error tolerance for a family of generalized proximal point methods

Mathematics of Operations Research

Volumn 26, Issue 4, 2001, Pages 816-831

  Burachik, Regina Sandra ^a   Svaiter, B F ^b  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b IMPA   (Brazil)

Author keywords

Enlargement of a maximal monotone operator; Extragradient method; Interior proximal point algorithm; Maximal monotone operator; Nonlinear complementarity problem

Indexed keywords

ERROR ANALYSIS; MATHEMATICAL OPERATORS; NONLINEAR EQUATIONS; OPTIMIZATION; PROBLEM SOLVING; VARIATIONAL TECHNIQUES;

EXTRAGRADIENT METHOD; GENERALIZED PROXIMAL POINT METHODS; INTERIOR PROXIMAL POINT ALGORITHM; MAXIMAL MONOTONE OPERATOR; NONLINEAR COMPLEMENTARITY PROBLEM; RELATIVE ERROR TOLERANCE;

ALGORITHMS;

EID: 0035518183     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.26.4.816.10011     Document Type: Article

References (26)

1. An interior proximal method for convex linearly constrained problems and its extension to variational inequalities
2. Interior proximal and multiplier methods based on second order homogeneous kernels
3. Coupling the logarithmic-quadratic proximal method and the block nonlinear Gauss-Seidel algorithm for linearly constrained convex minimization
4. A logarithmic-quadratic proximal method for variational inequalities
5. Penalty-barrier methods for convex programming problems
6. A generalized proximal point algorithm for the variational inequality problem in a Hilbert space
7. Enlargements of maximal monotone operators with application to variational inequalities
8. Epsilon-enlargement of maximal monotone operators with application to variational inequalities
9. ε-enlargements of maximal monotone operators in Banach spaces
10. An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
11. Non linear proximal point algorithms using Bregman functions, with applications to convex programming
12. Approximate iterations in Bregman-function-based proximal algorithms
13. Multiplicatively iterative algorithms for convex programming
14. Entropy-like proximal methods in convex programming
15. Convergence rate analysis of nonquadratic proximal and augmented Lagrangian methods for convex and linear programming
16. Proximal minimization methods with generalized Bregman functions
17. Regularization d'inéquations variationnelles par approximations succesives
18. On the maximality of sums of nonlinear monotone operators
19. Monotone operators and the proximal point algorithm
20. A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
21. Error bounds for proximal subproblems and associated inexact proximal point algorithms
22. An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
23. Entropic proximal mappings with application to nonlinear programming
24. Convergence of proximal-like algorithms
25. On the convergence of exponential multiplier method for convex programming