Journal of Optimization Theory and Applications

, Volume 88, Issue 1, pp 139–155 | Cite as

Nonlinear complementarity as unconstrained optimization

  • C. Kanzow
Contributed Papers


Several methods for solving the nonlinear complementarity problem (NCP) are developed. These methods are generalizations of the recently proposed algorithms of Mangasarian and Solodov (Ref. 1) and are based on an unconstrianed minimization formulation of the nonlinear complementarity problem. It is shown that, under certain assumptions, any stationary point of the unconstrained objective function is already a solution of NCP. In particulr, these assumptions are satisfied by the mangasarian and Soolodov implicit Lagranian functioin. Furthermore, a special Newton-type method is suggested, and conditions for its local quadratic convergence are given. Finally, some preliminary numerical results are presented.

Key Words

Nonlinear complementarity problemjs unconstrained minimization Newton-type methods global minima stationary points 


  1. 1.
    Mangasarian, O. L., andSolodov, J. V.,Nonlinear Complementarity as Unconstrianed and Constrianed Minimization Mathematical Programming, Vol 62B, pp. 277–297, 1993.Google Scholar
  2. 2.
    Harker, P. T., andPang, J. S.,Finite-Dimensional Variational Inequality and Nonlinear Complementarity Problems: A Survey of Thery, Alkgorithms, and Applications, Mathematical Programming, Vol. 48B, pp. 161–220, 1990.Google Scholar
  3. 3.
    Pang, J. S.,A B-Differentiable Equation-Based, Globally Locally Quadratically Convergent Algorithm for Nonlinear Programs, Complementary, and Variational Inequality Problems, Mathematical Programming, Vol. 51A, pp. 101–131. 1990.Google Scholar
  4. 4.
    Harker, P.T., andXiao, B.,Newton's Methods for the Nonlinear Complementarity Problem: A B-Differentialbe Equation Approach, Mathematical Programming, Vol. 48B, pp. 339–357, 1990.Google Scholar
  5. 5.
    Mangasarian, O. L.,Equivalence of the Complementarity Problem to a System of Nonlinear Equations, SIAM Journal on Applied Mathematics, Vol. 31, pp. 89–92, 1976.Google Scholar
  6. 6.
    Kanzow, C. Some Equation-Based Methods for the Nonlinear Complementarity Problem, Optimization Methods and Software, Vol. 3, pp. 327–340, 1994.Google Scholar
  7. 7.
    Subramanian, P. K.,Gauss-Newton Methods for the Complementarity Problem, Journal of Optimization Theory and Applications, Vol. 77, pp. 467–482, 1993.Google Scholar
  8. 8.
    Murty, K. G.,Linear Complementarity, Linear and Nonlinear Programming, Heldermann Verlag, Berlin, Germany, 1988.Google Scholar
  9. 9.
    Cottle, R. W., Pang, J. S., andStone, R. E.,The Linear Complementarity Problem, Academic Press, Boston, Massachusetts, 1992.Google Scholar
  10. 10.
    Kanzow, C., andKleimichel, H.,A Class of Newton-Type Methods for Equality and Inequality Constrained Optimization, Optimization Methods and Software Vol. 5, pp. 173–198, 1995.Google Scholar
  11. 11.
    Fischer, A.,A Special Newton-Type Optimization Method, Optimizatiion, Vol. 24, pp.269–284, 1992.Google Scholar
  12. 12.
    Yamashita, N., andFukushima, M.,On Stationary Points of the Implicit Lagrangian for Nonlinear complementary Problems, Journal of Optimization Theory and Applications, Vol. 84, pp. 653–663, 1995.Google Scholar
  13. 13.
    Gill, P. E., Murray, W., andWright, M. H.,Practical Optimization, Academic Press, London, England, 1981.Google Scholar
  14. 14.
    Hock, W., andSchittkowski, K.,Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, Springer Verlag, Berlin, Germany, Vol. 187, 1981.Google Scholar

Copyright information

© Plenum Publishing Corporation 1996

Authors and Affiliations

  • C. Kanzow
    • 1
  1. 1.Wissenschaftlicher Mitarbieiter, Institut für Angewandte MathematikUniversität HamburgHamburgGermany

Personalised recommendations