Abstract
We present an algorithm for the variational inequality problem on convex sets with nonempty interior. The use of Bregman functions whose zone is the convex set allows for the generation of a sequence contained in the interior, without taking explicitly into account the constraints which define the convex set. We establish full convergence to a solution with minimal conditions upon the monotone operatorF, weaker than strong monotonicity or Lipschitz continuity, for instance, and including cases where the solution needs not be unique. We apply our algorithm to several relevant classes of convex sets, including orthants, boxes, polyhedra and balls, for which Bregman functions are presented which give rise to explicit iteration formulae, up to the determination of two scalar stepsizes, which can be found through finite search procedures. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Bertsekas and J.N. Tsitsiklis,Parallel and Distributed Computation: Numerical Methods (Prentice-Hall, Englewood Cliffs, NJ, 1989).
L.M. Bregman, The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming,USSR Computational Mathematics and Mathematical Physics 7 (1967) 200–217.
R. Burachik, L.M. Graña Drummond, A.N. Iusem and B.F. Svaiter, On full convergence of the steepest descent method with inexact line searchesk, Optimization 32 (1995) 137–146.
Y. Censor, A.R. De Pierro, T. Elfving, G.T. Herman and A.N. Iusem, On iterative methods for linearly constrained entropy maximization, in: A. Wakulicz, ed.,Numerical Analysis and Mathematical Modelling, Banach Center Publications, Vol. 24 (PWN-Polish Scientific Publishers, Warsaw, Poland, 1990) 145–163.
Y. Censor and A. Lent, An iterative row-action method for interval convex programming,Journal of Optimization Theory and Applications 34 (1981) 321–353.
Y. Censor and S. Zenios, The proximal minimization algorithm withD-functions,Journal of Optimization Theory and Applications 73 (1992) 451–464; Y. Censor and S.A. Zenios,Parallel Optimization: Theory, Algorithms and Applications (Oxford Univ. Press, New York, NY, 1997).
G. Chen and M. Teboulle, Convergence analysis of a proximal-like optimization algorithm using Bregman functions,SIAM Journal on Optimization 3 (1993) 538–543.
J.E. Dennis and R.B. Schnabel,Numerical Methods for Unconstrained Minimization and Nonlinear Equations (Prentice-Hall, Englewood Cliffs, NJ, 1983).
A.R. De Pierro and A.N. Iusem, A relaxed version of Bregman's method for convex programming, Journal of Optimization Theory and Applications 51 (1986) 421–440.
J. Eckstein, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming,Mathematics of Operations Research 18 (1993) 202–226.
A.N. Iusem, On dual convergence and the rate of primal convergence of Bregman's convex programming method,SIAM Journal on Optimization 1 (1991) 401–423.
A.N. Iusem, An iterative algorithm for the variational inequality problem,Computational and Applied Mathematics 13 (1994) 103–114.
A.N. Iusem and B.F. Svaiter, A proximal regularization of the steepest descent method,RAIRO, Recherche Opérationelle 29 (1995) 123–130.
G.M. Korpolevich, The extragradient method for finding saddle points and other problems,Ekonomika i Matematcheskie Metody 12 (1976) 747–756.
A. Lent, A convergent algorithm for maximum entropy image restoration with a medical X-ray application, in: R. Shaw, ed.,Image Analysis and Evaluation (Society of Photographic Scientists and Engineers, Washington, DC, 1977) 249–257.
A. Lent and Y. Censor, The primal-dual algorithm as a constraint-set-manipulation device,Mathematical Programming 50 (1991) 343–357.
F. Liese and I. Vajda,Convex Statistical Distances (Teubner, Leipzig, 1987).
R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970).
Author information
Authors and Affiliations
Additional information
Corresponding author.
Rights and permissions
About this article
Cite this article
Censor, Y., Iusem, A.N. & Zenios, S.A. An interior point method with Bregman functions for the variational inequality problem with paramonotone operators. Mathematical Programming 81, 373–400 (1998). https://doi.org/10.1007/BF01580089
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580089