Some noninterior continuation methods for linear complementarity problems

SIAM Journal on Matrix Analysis and Applications

Volumn 17, Issue 4, 1996, Pages 851-868

  Kanzow, Christian ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

Global error bounds; Interior point methods; Linear complementarity problems; P0 matrix; Path following methods; R0 matrix

Indexed keywords

EID: 0030517292     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479894273134     Document Type: Article

References (40)

1. M. AGANAGIC AND R. W. COTTLE, A note on Q-matrices, Math. Programming, 16 (1979), pp. 374-377.
2. B. CHEN AND P. T. HARKER, A non-interior-point continuation method for linear complementarity problems, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 1168-1190.
3. R. W. COTTLE, J.-S. PANG, AND R. E. STONE, The Linear Complementarity Problem, Academic Press, New York, 1992.
4. J. E. DENNIS, JR. AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ, 1983.
5. F. FACCHINEI AND J. SOARES, A new merit function for nonlinear complementarity problems and a related algorithm, SIAM J. Optim., 7 (1997), to appear.
6. F. FACCHINEI AND J. SOARES, Testing a new class of algorithms for nonlinear complementarity problems, in Variational Inequalities and Network Equilibrium Problems, F. Giannessi and A. Maugeri, eds., Plenum Press, New York, 1995, pp. 69-83.
7. Y. FATHI, Computational complexity of LCPs associated with positive, definite matrices, Math. Programming, 17 (1979), pp. 335-344.
8. A. FISCHER, A special Newton-type optimization method, Optimization, 24 (1992), pp. 269-284.
9. _, A Newton-type method for positive semidefinite linear complementarity problems, J. Optim. Theory Appl., 80 (1995), pp. 585-608.
10. _, On the local superlinear convergence of a Newton-type method for LCP under weak conditions, Optimization Methods and Software, 6 (1995), pp. 83-107.
11. _, On an NCP-function and its use for the solution of complementarity problems, in Recent Advances in Nonsmooth Optimization, D.-Z. Du, L. Qi, and R. S. Womersley, eds., World Scientific Publishers, Singapore, 1995, pp. 88-105.
12. R. M. FREUND, Theoretical efficiency of a shifted-barrier-function algorithm for linear programming, Linear Algebra Appl., 152 (1991), pp. 19-41.
13. 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.
14. _, A class of nonmonotone stabilization methods in unconstrained optimization, Numer. Math., 59 (1991), pp. 779-805.
15. P. T. HARKER, Lectures on Computation of Equilibria with Equation-Based Methods, CORE Lecture Series, Louvain-la-Neuve, Belgium, 1993.
16. P. T. HARKER AND J.-S. PANG, A damped Newton method for the linear complementarity problem, in Computational Solution of Nonlinear Systems of Equations, Lectures in Applied Mathematics, Vol. 26, E. L. Allgower and K. Georg, eds., American Mathematical Society, Providence, RI, 1990, pp. 265-284.
17. G. ISAC, Complementarity Problems. Lecture Notes in Mathematics 1528, Springer-Verlag, Berlin, 1992.
18. C. KANZOW, Some equation-based methods for the nonlinear complementarity problem, Optimization Methods and Software, 3 (1994), pp. 327-340.
19. _, Global convergence properties of some iterative methods for linear complementarity problems, SIAM J. Optim., 6 (1996), pp. 326-341.
20. _, Some Tools Allowing Interior-Point Methods to Become Noninterior, Preprint 79, Institute of Applied Mathematics, University of Hamburg, Hamburg, Germany, February 1994.
21. _, Noninterior Continuation Methods for Mixed Linear Complementarity Problems, Preprint 85. Institute of Applied Mathematics, University of Hamburg, Hamburg, Germany, August 1994.
22. C. KANZOW AND H. KLEINMICHEL, A class of Newton-type methods for equality and inequality constrained optimization, Optimization Methods and Software, 5 (1995), pp. 173-198.
23. M. KOJIMA, N. MEGGIDO, AND T. NOMA, Homotopy continuation methods for nonlinear complementarity problems, Math. Oper. Res., 16 (1991), pp. 754-774.
24. M. KOJIMA, N. MEGGIDO, T. NOMA, AND A. YOSHISE, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Science 538, Springer-Verlag, Berlin, 1991.
25. M. KOJIMA, S. MIZUNO, AND T. NOMA, A new continuation method for complementarity problems with uniform P-functions, Math. Programming, 43 (1989), pp. 107-113.
26. _, Limiting behaviour of trajectories generated by a continuation method for monotone complementarity problems, Math. Oper. Res., 15 (1990), pp. 662-675.
27. X.-D. LUO AND P. TSENG, Conditions for a projection-type error bound for the linear complementarity problem to be global, Linear Algebra Appl., to appear.
28. O. L. MANGASARIAN, Equivalence of the complementarity problem to a system of nonlinear equations, SIAM J. Appl. Math., 31 (1976), pp. 89-92.
29. O. L. MANGASARIAN AND J. REN, New improved error bounds for the linear complementarity problem, Math. Programming, 66 (1994), pp. 241-255.
30. N. MEGGIDO, Pathways to the optimal set in linear programming, in Progress in Mathematical Programming. Interior Point and Related Methods, N. Meggido, ed., Springer-Verlag, New York, 1988.
31. K. G. MURTY, Linear Complementarity, Linear and Nonlinear Programming, Sigma Series in Applied Mathematics 3, Heldermann-Verlag, Berlin, 1988.
32. J.-S. PANG, Newton's method for B-differentiable equations, Math. Oper. Res., 15 (1990), pp. 311-341.
33. _, A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems, Math. Programming, 51 (1991), pp. 101-131.
34. 0-matrix linear complementarity problems using a potential reduction algorithm, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 1048-1060.
35. R. POLYAK, Modified barrier functions (theory and methods), Math. Programming, 54 (1992), pp. 177-222.
36. L. Qi AND H. JIANG, Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving These Equations, Technical Report AMR 94/5, School of Mathematics, University of New South Wales, Sydney, Australia, March 1994 (revised November 1994).
37. M. J. TODD, The two faces of the linear complementarity problem, SIAG/OPT Views-and-News, 5 (Fall 1994), pp. 3-5.
38. PH. L. TOINT, An assessment of nonmonotone linesearch techniques for unconstrained optimization, SIAM J. Sci. Comput., 17 (1996), pp. 561-578.
39. _, A Non-Monotone Trust-Region Algorithm for Nonlinear Optimization Subject to Convex Constraints, Report 94/24, Department of Mathematics, Facultés Universitaires ND de la Paix, Namur, Belgium, November 1994.
40. P. TSENG, Growth behaviour of a class of merit functions for the nonlinear complementarity problem, J. Optim. Theory Appl., 89 (1996), pp. 17-37.