A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution

Optimization Methods and Software

Volumn 21, Issue 4, 2006, Pages 597-615

  Sun, Jie ^a   Huang, Zheng Hai ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b TIANJIN UNIVERSITY   (China)

Author keywords

Finite termination; Linear complementarity problem; Maximally complementary solution; Smoothing method; Sufficient matrix

Indexed keywords

ALGORITHMS; FUNCTIONS; ITERATIVE METHODS; LINEAR EQUATIONS; MATRIX ALGEBRA;

FINITE TERMINATION; LINEAR COMPLEMENTARITY PROBLEM; MAXIMALLY COMPLEMENTARY SOLUTION; SMOOTHING METHOD; SUFFICIENT MATRIX;

PROBLEM SOLVING;

EID: 33745600105     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780600627727     Document Type: Conference Paper

References (32)

1. Väliaho, H., 1999, P*-matrices are just sufficient. Linear Algebra and its Applications, 239, 103-108.
2. Cottle, R.W., Pang, J.-S. and Stone, R.E., 1992, The Linear Complementarity Problem (Boston: Academic Press).
3. Kojima, M., Megiddo, N., Noma, T. and Yoshise, A., 1991, A unified approach to interior point algorithms for linear complementarity problems. In: Lecture Notes in Computer Sciences, 538, (Berlin, Germany: Springer-Verlag).
4. Billup, S.C., Dirkse, S.P. and Ferris, M.C., 1997, A comparison of algorithms for large-scale mixed complementarity problems. Computational Optimization and Applications, 7, 3-25.
5. Engelke, S. and Kanzow, C., 2002, Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter. Computational Optimization and Application, 23, 299-320.
6. Engelke, S. and Kanzow, C., 2002, Improved smoothing-type methods for the solution of linear programming, Numerical Mathematics, 90, 487-507.
7. Burke, J. and Xu, S., 1998, The global linear convergence of a non-interior path-following algorithm for linear complementarity problems. Mathematics of Operations Research, 23, 719-734.
8. Burke, J. and Xu, S., 2000, A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem. Mathematical Programming, 87, 113-130.
9. 0 and monotone NCP. SIAM Journal on Optimization, 9, 624-645.
10. Chen, B. and Harker, P.T., 1993, A non-interior-point continuation method for linear complementarity problem. SIAM Journal on Matrix Analysis and Applications, 14, 1168-1190.
11. Chen, C. and Mangasarian, O.L., 1996, A class of smoothing functions for nonlinear and mixed complementarity problems. Computational Optimization and Applications, 5, 97-138.
12. Chen, B. and Xiu, N., 1999, A global linear and local quadratic non-interior continuation method for nonlinear complementarity problems based on Chen- Mangasarian smoothing functions. SIAM Journal on Optimization, 9, 605-623.
13. 0 function. Journal of Optimization Theory and Applications, 117, 39-68.
14. 0- and monotone LCP. Mathematical Programming, 99, 423-441.
15. Kanzow, C., 1996, Some noninterior continuation methods for linear complementarity problems. SIAM Journal on Matrix Analysis and Applications, 17, 851-868.
16. Qi, L., Sun, D. and Zhou, G., 2000, A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequality problems. Mathematical Programming, 87, 1-35.
17. Tseng, P., 1999, Analysis of a non-interior continuation method based on Chen-Mangasarian smoothing functions for complementarity problems. In M. Fukushima and L. Qi, (Eds) Reformulation-Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods (Boston: Kluwer Academic Publishers), pp. 381-404.
18. 0 function nonlinear complementarity problem. Operations Research Letters, 30, 202-210.
19. Mehrotra, S. and Ye, Y., 1993, On finding the optimal facet of linear programs. Mathematical Programmming, 62, 497-515.
20. Ye, Y., 1992, On the finite convergence of interior-point algorithms for linear programming. Mathematical Programming, 57, 325-335.
21. Andreani, R. and Martinez, J.M., 1999, On the reformulation of nonlinear complementarity problems using the Fischer-Burmeister function. Applied Mathematics Letters, 12, 7-12.
22. Fang, S.C., Han, J., Huang. Z.H. and İlker Birbil, Ş., On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems. Journal of Global Optimization (in press).
23. Fischer, A. and Kanzow, C., 1996, On the finite termination of an iterative method for linear complementarity problems. Mathematical Programming, 74, 279-292.
24. 0-LCP. Journal of Computational Mathematics, 22, 797-806.
25. Illés, T., Peng, J.M., Roos, C. and Terlaky, T., 2000, A strongly polynomial procedure yielding a maximally complementarity solution for P*(κ) linear complementarity problems. SIAM Journal on Optimization, 11, 320-340.
26. Zhang, J. and Xiu, N., 2003, Identification of the optimal active set in a noninterior continuation method for LCP. Journal of Global Optimization, 26, 183-198.
27. Chen, X. and Ye, Y., 1999, On homotopy-smoothing methods for variational inequalities. SIAM Journal on Control and Optimization, 37, 589-616.
28. 0 LCPs. SIAM Journal on Optimization, 13, 1196-1221.
29. 0 matrix linear complementarity problems. SIAM Journal on Optimization, 11, 341-363.
30. Robinson, S.M., 1981, Some continuity properties of polyhedral multifunctions. Mathematical Programming Study, 14, 206-214.
31. Pang, J.-S., 1997, Error bounds in mathematical programming. Mathematical Programming, 79, 299-332.
32. Güler, O., Hoffman, A.J. and Rothblum, U.G., 1995, Approximations to solutions to systems of linear inequalities. SIAM Journal on Matrix Analysis and Applications, 16, 688-696.