Global convergence properties of some iterative methods for linear complementarity problems

SIAM Journal on Optimization

Volumn 6, Issue 2, 1996, Pages 326-341

  Kanzow, Christian ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

Global convergence; Linear complementarity; Newton's method

Indexed keywords

EID: 0030303836     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/0806019     Document Type: Article

References (28)

1. R. W. COTTLE, J.-S. PANG, AND R. E. STONE, The Linear Complementarity Problem, Academic Press, Boston, 1992.
2. J. E. DENNIS, JR. AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1996.
3. Y. G. EVTUSHENKO AND V. A. PURTOV, Sufficient conditions for a minimum for nonlinear programming problems, Soviet Math. Dokl., 30 (1984), pp. 313-316.
4. Y. FATHI, Computational complexity of LCPs associated with positive definite matrices, Math. Programming (Series A), 17 (1979), pp. 335-344.
5. M. C. FERRIS AND S. LUCIDI, Globally Convergent Methods for Nonlinear Equations, Tech. report 1030, Computer Sciences Department, University of Wisconsin, Madison, WI, July 1991. J. Optim. Theory Appl., 81 (1994), pp. 53-71.
6. A. FISCHER, A special Newton-type optimization method, Optimization, 24 (1992), pp. 269-284.
7. _, A Newton-type Method for Positive Semidefinite Linear Complementarity Problems, Tech. report MATH-NM-04-1992, Institute of Numerical Mathematics, University of Technology Dresden, Dresden, Germany. J. Optim. Theory Appl., 86 (1995), pp. 585-608.
8. _, On the Local Superlinear Convergence of a Newton-type Method for LCP Under Weak Conditions, Tech. report MATH-NM-07-1993, Institute of Numerical Mathematics, University of Technology Dresden, Dresden, Germany, June 1993 (revised March 1994).
9. L. GRIPPO, F. LAMPARIELLO, AND S. LUCIDI, A nonmonotone line search technique for Newton's method, SIAM J. Numer. Anal., 23 (1986), pp. 707-716.
10. P. T. HARKER AND J.-S. PANG, A damped Newton method for the linear complementarity problem, in Computational Solution of Nonlinear Systems of Equations, E. L. Allgower and K. Georg, eds., Lectures in Applied Mathematics, Vol. 26, American Mathematical Society, Providence, RI, 1990, pp. 265-284.
11. P. T. HARKER AND B. XIAO, Newton's method for the nonlinear complementarity problem: A B-differentiable equation approach, Math. Programming (Series A), 48 (1990), pp. 339-357.
12. W. HOCK AND K. SCHITTKOWSKI, Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems 187, Springer-Verlag, Berlin, Germany, 1981.
13. C. KANZOW, Newton-type Methods for Nonlinearly Constrained Optimization, Institute of Applied Mathematics, University of Hamburg, Hamburg, Germany, December 1992, preprint 62.
14. _, Some equation-based methods for the nonlinear complementarity problem, Optim. Meth. Software, 3 (1994), pp. 327-340.
15. _, Nonlinear Complementarity as Unconstrained Optimization, Institute of Applied Mathematics, University of Hamburg, Hamburg, Germany, March 1993 (revised February and August 1994), preprint 67, J. Optim. Theory Appl., to appear.
16. C. KANZOW AND H. KLEINMICHEL, A Class of Newton-type Methods for Equality and Inequality Constrained Optimization, Institute of Applied Mathematics, University of Hamburg, Hamburg, Germany, November 1992 (revised March and July 1994), preprint 61, Optim. Meth. Software, 5 (1995), pp. 173-198.
17. O. L. MANGASARIAN, Equivalence of the complementarity problem to a system of nonlinear equations, SIAM J. Appl. Math., 11 (1976), pp. 89-92.
18. O. L. MANGASARIAN AND M. V. SOLODOV, Nonlinear complementarity as unconstrained and constrained minimization, Math. Programming (Series B), 62 (1993), pp. 277-297.
19. K. G. MURTY, Linear Complementarity, Linear and Nonlinear Programming, Sigma Series in Applied Mathematics 3, Heldermann Verlag, Berlin, Germany, 1988.
20. J.-S. PANG, Newton's method for B-differentiable equations, Math. Oper. Res., 15 (1990), pp. 311-341.
21. _, A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems, Math. Programming (Series A), 51 (1991), pp. 101-131.
22. V. A. PURTOV, Fast convergent nonlinear programming methods, in Numerical Methods of Nonlinear Programming and their Implementations, C. Richter, H. Hollatz, and D. Pallaschke, eds., Akademie-Verlag, Berlin, Germany, 1991, pp. 87-98.
23. J. STOER AND R. BULIRSCH, Introduction to Numerical Analysis, Springer-Verlag, New York, Heidelberg, Berlin, 1980.
24. P. K. SUBRAMANIAN, Gauss-Newton methods for the complementarity problem, J. Optim. Theory Appl., 77 (1993), pp. 467-482.
25. J. A. TOMLIN, Users Guide for LCPL. A Program for Solving Linear Complementarity Problems by Lemke's Method, Tech. report SOL 76-16, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA, August 1976.
26. P. TSENG, Growth Behaviour of a Class of Merit Functions for the Nonlinear Complementarity Problem, Tech. report, University of Washington, Seattle, WA, May 1994, J. Optim. Theory Appl., to appear.
27. L. T. WATSON, Solving the nonlinear complementarity problem by a homotopy method, SIAM J. Control Optim., 17 (1979), pp. 36-46.
28. Y. ZHANG, R. A. TAPIA, AND F. POTRA, On the superlinear convergence of interior-point algorithms for a general class of problems, SIAM J. Optim., 3 (1993), pp. 413-422.