Abstract
This paper describes two interior-point algorithms for solving a class of monotone variational inequalities defined over the intersection of an affine set and a closed convex set. The first algorithm is a long-step path-following method, and the second is an extension of the first, incorporating weights in the gradient of the barrier function. Global convergence of the algorithms is proven under the assumptions of monotonicity and differentiability of the operator.
Similar content being viewed by others
References
Harker, P. T., and Pang, J. S., Finite-Dimensional Variational Inequality and Nonlinear Complementarity Problems: A Survey of Theory, Algorithms, and Applications, Mathematical Programming, Vol. 48, pp. 161–220, 1990.
Harker, P. T., Lectures on Computation of Equilibria with Equation-Based Methods, Core Lecture Series, 1993.
Goffin, J. L., Marcotte, P., and Zhu, D., An Analytic Center Cutting-Plane Method for Pseudomonotone Variational Inequalities, Operations Research Letters, Vol. 20, pp. 1–6, 1997.
Jansen, B., Interior-Point Techniques in Optimization: Complementarity, Sensitivity, and Algorithms, PhD Thesis, Delft University of Technology, Delft, Netherlands, 1995.
Nesterov, Yu. E., and Nemirovskii, A. S., Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, Pennsylvania, 1994.
Ralph, D., and Wright, S., Superlinear Convergence of an Interior-Point Method for Monotone Variational Inequalities, Preprint MCS-P556-0196, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Illinois, 1996.
Sun, J., and Zhao, G., Global and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior-Point Method for Some Monotone Variational Inequality Problems, Report, National University of Singapore, Kent Ridge, Singapore, 1996.
Tseng, P., Global Linear Convergence of a Path-Following Algorithm for Some Monotone Variational Inequality Problems, Journal of Optimization Theory and Applications, Vol. 75, pp. 265–279, 1992.
Wu, J. H., A Modified Path-Following Scheme for the Monotone Variational Inequality Problem, Publication CRT 985, Centre de Recherche sur les Transports, Université de Montreal, 1994; revised June 1996.
Wu, J. H., Rubio-Ardanaz, J. M., and Florian, M., A Primal Path-Following Algorithmic Scheme for the Monotone Variational Inequality Problem with One Simple Constraint and Nonnegative Variables: An Implementation and Computational Experience, Publication CRT 95-39, Centre de Recherche sur les Transports, Université de Montréal, 1995.
Den Hertog, D., Jarre, F., Roos, C., and Terlaky, T., A Sufficient Condition for Self-Concordance, with Applications to Some Classes of Structured Convex Programming Problems, Mathematical Programming, Vol. 69, pp. 75–88, 1995.
Den Hertog, D., Interior-Point Approach to Linear, Quadratic, and Convex Programming: Algorithms and Complexity, Kluwer Publishers, Dordrecht, Netherlands, 1994.
Gonzaga, C. C., Large-Step Path-Following Methods for Linear Programming, Part 1: Barrier Function Method, SIAM Journal on Optimization, Vol. 1, pp. 268–279, 1991.
Kojima, M., Megiddo, N., and Mizuno, S., Theoretical Convergence of Large-Step Primal-Dual Interior-Point Algorithms for Linear Programming, Mathematical Programming, Vol. 59, pp. 1–21, 1993.
Fukushima, M., Equivalent Differentiable Optimization Problems and Descent Methods for Asymmetric Variational Inequality Problems, Mathematical Programming, Vol. 53, pp. 99–110, 1992.
Jarre, F., On the Method of Analytic Centers for Solving Smooth Convex Programs, Lecture Notes in Mathematics, Springer, Berlin, Germany, Vol. 1405, pp. 69–85, 1989.
Jarre, F., Interior-Point Methods for Convex Programming, Applied Mathematics and Optimization, Vol. 26, pp. 287–311, 1992.
Rockafellar, R. T., Lagrange Multipliers and Variational Inequalities, Variational Inequalities and Complementarity Problems: Theory and Applications, Edited by R. W. Cottle, F. Giannessi, and J. L. Lions, Wiley, New York, New York, pp. 303–322, 1980.
Taji, K., Fukushima, M., and Ibaraki, T., A Globally Convergent Newton Method for Solving Variational Inequalities, Mathematical Programming, Vol. 58, pp. 369–383, 1993.
Goffin, J. L., and Vial, J. P., On the Computation of Weighted Analytic Centers and Dual Ellipsoids with the Projective Algorithm, Mathematical Programming, Vol. 60, pp. 81–92, 1993.
Atkinson, D. S., and Vaidya, P. M., A Scaling Technique for Finding the Weighted Analytic Center of a Polytope, Mathematical Programming, Vol. 57, pp. 163–192, 1992.
Jansen, B., Roos, C., Terlaky, T., and Vial, J. P., Primal-Dual Target-Following Algorithms for Linear Programming, Annals of Operations Research, Vol. 62, pp. 197–231, 1996.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sharifi-Mokhtarian, F., Goffin, J.L. Long-Step Interior-Point Algorithms for a Class of Variational Inequalities with Monotone Operators. Journal of Optimization Theory and Applications 97, 181–210 (1998). https://doi.org/10.1023/A:1022683302494
Issue Date:
DOI: https://doi.org/10.1023/A:1022683302494