Interior-point methods for nonlinear complementarity problems

Journal of Optimization Theory and Applications

Volumn 88, Issue 3, 1996, Pages 617-642

  Potra, F A ^a   Ye, Y ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

Complementarity problems; Convergence rates; Interior point methods

Indexed keywords

LINEAR PROGRAMMING; NEWTON-RAPHSON METHOD;

APPROXIMATE SOLUTION; COMPLEMENTARITY PROBLEMS; CONVERGENCE RATES; GLOBAL CONVER-GENCE; INTERIOR POINT ALGORITHM; INTERIOR-POINT METHOD; LIPSCHITZ CONDITIONS; LOCAL CONVERGENCE; NONLINEAR COMPLEMENTARITY PROBLEM; POTENTIAL REDUCTION;

NONLINEAR SYSTEMS;

EID: 0030537448     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02192201     Document Type: Article

References (21)

1. DEN HERTOG, D., ROOS, C., and TERLAKY, T., On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems, Journal of Optimization Theory and Applications, Vol. 73, pp. 1-25, 1992.
2. JARRE, F., The Method of Analytic Centers for Smooth Convex Programs, PhD Thesis, Institut für Angewandte Mathematik und Statistik, Universität Würzburg, Würzburg, Germany, 1989.
3. MONTEIRO, R. D. C., and ADLER, I., An Extension of Karmarkar-Type Algorithms to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence, Mathematics of Operations Research, Vol. 15, pp. 408-422, 1990.
4. NESTEROV, Y. E., and NEMIROVSKY, A. S., Interior-Point Polynomial Methods in Convex Programming: Theory and Algorithms, SIAM Publications, Philadelphia, Pennsylvania, 1994.
5. ZHANG, Y., and TAPIA, R. A., A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming, SIAM Journal on Optimization, Vol. 3, pp. 118-133, 1993.
6. POTRA, F. A., and YE, Y., A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems, SIAM Journal on Optimization, Vol. 3, pp. 843-860, 1993.
7. GÜLER, O., and YE, Y., Convergence Behavior of Interior-Point Algorithms, Mathematical Programming, Vol. 60, pp. 215-228, 1993.
8. YE, Y., On the Finite Convergence of Interior-Point Algorithms for Linear Programming, Mathematical Programming, Vol. 57, pp. 325-335, 1992.
9. MEGIDDO, N., Pathways to the Optimal Set in Linear Programming, Progress in Mathematical Programming: Interior Point and Related Methods, Springer Verlag, New York, New York, pp. 131-158, 1989.
10. MCLINDEN, L., The Analogue of Moreau's Proximation Theorem, with Applications to the Nonlinear Complementarity Problem, Pacific Journal of Mathematics, Vol. 88, pp. 101-161, 1980.
11. KOJIMA, M., MEGIDDO, N., and NOMA, T., Homotopy Continuation Methods for Nonlinear Complementarity Problems, Mathematics of Operations Research, Vol. 16, pp. 754-774, 1991.
12. KOJIMA, M., MIZUNO, S., and NOMA, T., A New Continuation Method for Complementarity Problems with Uniform P-Functions, Mathematical Programming, Vol. 43, pp. 107-113, 1989.
13. KOJIMA, M., MIZUNO, S., and NOMA, T., Limiting Behavior of Trajectories by a Continuation Method for Monotone Complementarity Problems, Mathematics of Operations Research, Vol. 15, pp. 662-675, 1990.
14. KOJIMA, M., MIZUNO, S., and YOSHISE, A., A Polynomial-Time Algorithm for a Class of Linear Complementarity Problems, Mathematical Programming, Vol. 44, pp. 1-26, 1989.
15. KOJIMA, M., MIZUNO, S., and YOSHISE, A., An O(√NL) Iteration Potential Reduction Algorithm for Linear Complementarity Problems, Mathematical Programming, Vol. 50, pp. 331-342, 1991.
16. KOJIMA, M., MEGIDDO, N., NOMA, T., and YOSHISE, A., A Unified Approach to Interior-Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Sciences, Springer Verlag, New York, New York, Vol. 538, 1991.
17. ZHU, J., A Path Following Algorithm for a Class of Convex Programming Problems, Zeitschrift für Operations Research - Methods and Models of Operations Research, Vol. 36, pp. 539-577, 1992.
18. GÜLER, O., Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems, Mathematics of Operations Research, Vol. 18, pp. 128-147, 1993.
19. KORTANEK, K. O., POTRA, F., and YE, Y., On Some Efficient Interior-Point Methods for Nonlinear Convex Programming, Linear Algebra and Its Applications, Vol. 152, pp. 169-189, 1991.
20. MONTEIRO, R. D. C., and ADLER, I., Interior Path-Following Primal-Dual Algorithms, Part 1: Linear Programming, Mathematical Programming, Vol. 44, pp. 27-41, 1989.
21. TODD, M. J., and YE, Y., Approximate Farkas Lemmas and Stopping Rules for Iterative Infeasible-Point Algorithm for Linear Programming, Technical Report, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York, 1994.