Complexity of a noninterior path-following method for the linear complementarity problem

Journal of Optimization Theory and Applications

Volumn 112, Issue 1, 2002, Pages 53-76

  Burke, J ^a   Xu, S ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

complexity of algorithms; Linear complementarity; noninterior path following methods

Indexed keywords

COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; FUNCTIONS;

COMPLEXITY OF ALGORITHM; LINEAR COMPLEMENTARITY; LINEAR COMPLEMENTARITY PROBLEMS; NON-INTERIOR; NONINTERIOR PATH-FOLLOWING METHOD; P-MATRICES; P-MATRIX; PATH-FOLLOWING METHOD; POSITIVE DEFINITE; SYMMETRICS;

MATRIX ALGEBRA;

EID: 0036115023     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013040428127     Document Type: Article

References (26)

1. BURKE, J., and XU, S., The Global Linear Convergence of a Noninterior PathFollowing Algorithm for Linear Complementarity Problems, Mathematics of Operations Research, Vol. 23, pp. 719-734, 1998.
2. BURKE, J., and XU, S., A Noninterior Predictor-Corrector Path-Following Algorithm for the Monotone Linear Complementarity Problem, Mathematical Programming, Vol. 87, pp. 113-130, 2000.
3. CHEN, B., and CHEN, X., A Global Linear and Local Quadratic Continuation Method for Variational Inequalities with Box Constraints, Computational Optimization and Applications, Vol. 17, pp. 131-158, 2000.
4. o and Monotone NCP, SIAM Journal on Optimization, Vol. 9, pp. 605-623, 1999.
5. CHEN, B., and HARKER, P. T., A Noninterior Point Continuation Method for Linear Complementarity Problems, SIAM Journal on Matrix Analysis and Applications, Vol. 14, pp. 1168-1190, 1993.
6. CHEN, B., and XIU, N., A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen-Mangasarian Smoothing Functions, SIAM Journal on Optimization, Vol. 9, pp. 605-623, 1999.
7. CHEN, X., QI, L., and SUN, D., Global and Superlinear Convergence of the Smoothing Newton Method and Its Application to General Box-Constrained Variational Inequalities, Mathematics of Computation, Vol. 67, pp. 519-540, 1998.
8. CHEN, X., and YE, Y., On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities, SIAM Journal on Control and Optimization, Vol. 37, pp. 589-616, 1999.
9. HOTTA, K., and YOSHISE, A., Global Convergence of a Class of Noninterior Point Algorithms Using Chen-Harker-Kanzow Functions for Nonlinear Complementarity Problems, Mathematical Programming, Vol. 86, pp. 105-133, 1999.
10. JIANG, H., Global Convergence Analysis of the Generalized Newton and Gauss-Newton Methods for the Fischer-Burmeister Equation for the Complementarity Problem, Mathematics of Operations Research, Vol. 24, pp. 529-543, 1999.
11. KANZOW, C., Some Noninterior Continuation Methods for Linear Complementarity Problems, SIAM Journal on Matrix Analysis and Applications, Vol. 17, pp. 851-868, 1996.
12. QI, L., and SUN, D., Improving the Convergence of Noninterior Point Algorithms for Nonlinear Complementarity Problems, Mathematics of Computation, Vol. 69, pp. 283-304, 2000.
13. QI, L., SUN, D., and ZHOU, G., A New Look at Smoothing Newton Methods for Nonlinear Complementarity Problems and Box-Constrained Variational Inequalities, Mathematical Programming, Vol. 87, pp. 1-35, 2000.
14. TSENG, P., Analysis of a Noninterior Continuation Method Based on Chen-Mangasarian Smoothing Functions for Complementarity Problems, Reformulation: Nonsmooth, Piecewise Smooth, Semismooth, and Smoothing Methods, Edited by M. Fukushima and L. Qi, Kluwer Academic Publishers, Dordrecht, Holland, pp. 381-404, 1997.
15. XU, S., The Global Linear Convergence of an Infeasible Noninterior Path-Following Algorithm for Complementarity Problems with Uniform P-Functions, Mathematical Programming, Vol. 87, pp. 501-517, 2000.
16. Xu, S., The Global Linear Convergence and Complexity of a Noninterior Path-Following Algorithm for Monotone LCP Based on the Chen-Harker-Kanzow-Smale Smoothing Function, Technical Report, Department of Mathematics, University of Washington, Seattle, Washington, 1997.
17. Xu, S., and BURKE, J. V., A Polynomial-Time Interior-Point Path-Following Algorithm for LCP Based on Chen-Harker-Kanzow Smoothing Techniques, Mathematical Programming, Vol. 86, pp. 91-103, 1999.
18. HOTTA, K., INABA, M., and YOSHISE, A., A Complexity Analysis of a Smoothing Method Using CHKS-Functions for Monotone Linear Complementarity Problems, Computational Optimization and Applications, Vol. 17, pp. 183-201, 2000.
19. SMALE, S., Algorithms for Solving Equations, Proceedings of the International Congress of Mathematicians, American Mathematical Society, Providence, Rhode Island, pp. 172-195, 1987.
20. CHEN, C., and MANGASARIAN, O. L., A Class of Smoothing Functions for Nonlinear and Mixed Complementarity Problems, Computational Optimization and Applications, Vol. 5, pp. 1168-1190, 1996.
21. LUO, X. D., and TSENG, P., On a Global Projection-Type Error Bound for the Linear Complementarity Problem, Linear Algebra and Its Applications, Vol. 253, pp. 251-278, 1997.
22. MANGASARIAN, O. L., and REN, J., New Improved Error Bounds for the Linear Complementarity Problem, Mathematical Programming, Vol. 66, pp. 241-255, 1994.
23. MATHIAS, R., and PANG, J. S., Error Bounds for the Linear Complementarity Problem with a P-Matrix, Linear Algebra and Its Applications, Vol. 132, pp. 123-136, 1990.
24. TSENG, P., Growth Behavior of a Class of Merit Functions for the Nonlinear Complementarity Problem, Journal of Optimization Theory and Applications, Vol. 89, pp. 17-37, 1996.
25. COTTLE, R. W., PANG, J. S., and STONE, R. E., The Linear Complementarity Problem, Academic Press, New York, NY, 1992.
26. SMITH, R. L., Some Interlacing Properties of the Schur Complement of a Hermitian Matrix, Linear Algebra and Its Applications, Vol. 177, pp. 137-144, 1992.