Long-Step Interior-Point Algorithms for a Class of Variational Inequalities with Monotone Operators 1,2

Journal of Optimization Theory and Applications

Volumn 97, Issue 1, 1998, Pages 181-210

  Sharifi Mokhtarian, F ^a   Goffin, J L ^b  

^a MCGILL UNIVERSITY   (Canada)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

Barrier functions; Interior point methods; Monotone variational inequalities; Newton method; Self concordant operators

Indexed keywords

LINEAR PROGRAMMING; SET THEORY; VARIATIONAL TECHNIQUES;

ALGORITHM FOR SOLVING; BARRIERS FUNCTIONS; CLOSED CONVEX SETSS; INTERIOR POINT ALGORITHM; INTERIOR-POINT METHOD; MONOTONE OPERATORS; MONOTONE VARIATIONAL INEQUALITY; NEWTON'S METHODS; SELF-CONCORDANT OPERATOR; VARIATIONAL INEQUALITIES;

NEWTON-RAPHSON METHOD;

EID: 0032339601     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022683302494     Document Type: Article

References (22)

1. 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.
2. HARKER, P. T., Lectures on Computation of Equilibria with Equation-Based Methods, Core Lecture Series, 1993.
3. 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.
4. JANSEN, B., Interior-Point Techniques in Optimization: Complementarity, Sensitivity, and Algorithms, PhD Thesis, Delft University of Technology, Delft, Netherlands, 1995.
5. NESTEROV, Yu. E., and NEMIROVSKII, A. S., Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, Pennsylvania, 1994.
6. 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.
7. 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.
8. 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.
9. 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 Montréal, 1994; revised June 1996.
10. 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.
11. 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.
12. DEN HERTOG, D., Interior-Point Approach to Linear, Quadratic, and Convex Programming: Algorithms and Complexity, Kluwer Publishers, Dordrecht, Netherlands, 1994.
13. 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.
14. 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.
15. FUKUSHIMA, M., Equivalent Differentiable Optimization Problems and Descent Methods for Asymmetric Variational Inequality Problems, Mathematical Programming, Vol. 53, pp. 99-110, 1992.
16. 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.
17. JARRE, F., Interior-Point Methods for Convex Programming, Applied Mathematics and Optimization, Vol. 26, pp. 287-311, 1992.
18. 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.
19. TAJI, K., FUKUSHIMA, M., and IBARAKI, T., A Globally Convergent Newton Method for Solving Variational Inequalities, Mathematical Programming, Vol. 58, pp. 369-383, 1993.
20. 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.
21. 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.
22. 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.