A Relative Error Tolerance for a Family of Generalized Proximal Point Methods

References

• Auslender A., Haddou M. An interior proximal method for convex linearly constrained problems and its extension to variational inequalities. Math. Programming (1995) 71:77–100Crossref, Google Scholar
• Auslender A., Teboulle M., Ben-Tiba S. Interior proximal and multiplier methods based on second order homogeneous kernels. Math. Oper. Res. (1999a) 24(3):645–669Link, Google Scholar
• Auslender A., Teboulle M., Ben-Tiba S., Thera M., Tichatschke R. Coupling the logarithmic-quadratic proximal method and the block nonlinear Gauss-Seidel algorithm for linearly constrained convex minimization. Ill-posed Variational Problems and Regularization Techniques (1999b) (Springer, Berlin, Germany) 35–47Crossref, Google Scholar
• Auslender A., Teboulle M., Ben-Tiba S. A logarithmic-quadratic proximal method for variational inequalities. Comput. Optim. Appl. (1999c) 12:31–40Crossref, Google Scholar
• Ben-Tal A., Zibulevsky M. Penalty-barrier methods for convex programming problems. SIAM J. Optim. (1997) 7:347–366Crossref, Google Scholar
• Burachik R. S., Iusem A. N. A generalized proximal point algorithm for the variational inequality problem in a Hilbert space. SIAM J. Optim. (1998) 8:197–216Crossref, Google Scholar
• Burachik R. S., Iusem A. N., Svaiter B. F. Enlargements of maximal monotone operators with application to variational inequalities. Set Valued Anal. (1997a) 5:159–180Crossref, Google Scholar
• Burachik R. S., Sagastizábal C. A., Svaiter B. F., Fukushima M., Qi L. Epsilon-enlargement of maximal monotone operators with application to variational inequalities. Reformulation—Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods (1997b) (Kluwer Academic Publishers, Dordrecht) Google Scholar
• Burachik R. S., Svaiter B. F. ε-enlargements of maximal monotone operators in Banach spaces. Set Valued Anal. (1999) 7(2):117–132Crossref, Google Scholar
• Censor Y., Iusem A. N., Zenios S. A. An interior point method with Bregman functions for the variational inequality problem with paramonotone operators. (1994) . Working paper, University of HaifaGoogle Scholar
• Eckstein J. Non linear proximal point algorithms using Bregman functions, with applications to convex programming. Math. Oper. Res. (1993) 18:202–226Link, Google Scholar
• Eckstein J. Approximate iterations in Bregman-function-based proximal algorithms. Math. Programming (1998) 83(1):113–123Series ACrossref, Google Scholar
• Eggermont P. Multiplicatively iterative algorithms for convex programming. Linear Algebra Appl. (1990) 130:25–42Crossref, Google Scholar
• Iusem A. N., Svaiter B. F., Teboulle M. Entropy-like proximal methods in convex programming. Math. Oper. Res. (1994) 19:790–814Link, Google Scholar
• Iusem A. N., Teboulle M. Convergence rate analysis of nonquadratic proximal and augmented Lagrangian methods for convex and linear programming. Math. Oper. Res. (1995) 20:657–677Link, Google Scholar
• Kiwiel K. C. Proximal minimization methods with generalized Bregman functions. SIAM J. Control Optim. (1997) 35:1142–1168Crossref, Google Scholar
• Martinet B. Regularization d'inéquations variationnelles par approximations succesives. Revue Française de Informatique et Recherche Opérationelle (1970) 2:154–159Google Scholar
• Nesterov Y., Nemirovski A.Interior Point Polynomial Algorithms in Convex Programming (1994) (SIAM Publications, Philadelphia, PA) Crossref, Google Scholar
• Rockafellar T. On the maximality of sums of nonlinear monotone operators. Transactions Amer. Math. Society (1970) 149:75–88Crossref, Google Scholar
• Rockafellar T. Monotone operators and the proximal point algorithm. SIAM J. Control Optim. (1976) 14(5):877–898Crossref, Google Scholar
• Solodov M. V., Svaiter B. F. A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set Valued Anal. (1999) 7(4):323–346Crossref, Google Scholar
• Solodov M. V., Svaiter B. F. Error bounds for proximal subproblems and associated inexact proximal point algorithms. Math. Programming (2000a) 88(2):371–389Crossref, Google Scholar
• Solodov M. V., Svaiter B. F. An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions. Math. Oper. Res. (2000b) . forthcomingLink, Google Scholar
• Teboulle M. Entropic proximal mappings with application to nonlinear programming. Math. Oper. Res. (1992) 17(2):670–690Link, Google Scholar
• Teboulle M. Convergence of proximal-like algorithms. SIAM J. Optim. (1997) 7:1069–1083Crossref, Google Scholar
• Tseng P., Bertsekas D. On the convergence of exponential multiplier method for convex programming. Math. Programming (1993) 60:1–19Crossref, Google Scholar