Mathematics of Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MATHEMATICS OF OPERATIONS RESEARCH
Vol. 26, No. 4, November 2001, pp. 816-831
DOI: 10.1287/moor.26.4.816.10011
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Burachik, R. S.
Right arrow Articles by Svaiter, B. F.
Right arrow Search for Related Content

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

Regina Sandra Burachik, B. F. Svaiter

Engenharia de Sistemas e Computação, COPPE-UFRJ, CP 68511, Rio de Janeiro-RJ, CEP 21945-970, Brazil
IMPA, Instituto de Mathemática Pura e Aplicada, Estrada Dona Castorina, 110, Rio de Janeiro, RJ, CEP 22460-320, Brazil

regi{at}cos.ufrj.br
benar{at}impa.br

We propose a new kind of inexact scheme for a family of generalized proximal point methods for the monotone complementarity problem. These methods, studied by Auslender, Teboulle, and Ben-Tiba, converge under the sole assumption of existence of solutions. We prove convergence of our new scheme and discuss its implementability.

Key Words: Maximal monotone operator; nonlinear complementarity problem; interior proximal point algorithm; extragradient method; enlargement of a maximal monotone operator
History: Received: November 13, 1999; revision received: October 15, 2000;





HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2001 by INFORMS.