Skip to main content
SpringerLink
Log in

An inexactQP-based method for nonlinear complementarity problems

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary.

We consider a quadratic programming-based method for nonlinear complementarity problems which allows inexact solutions of the quadratic subproblems. The main features of this method are that all iterates stay in the feasible set and that the method has some strong global and local convergence properties. Numerical results for all complementarity problems from the MCPLIB test problem collection are also reported.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, University of Hamburg, Bundesstrasse 55, D-20146 Hamburg, Germany; e-mail: kanzow@math.uni-hamburg.de , , , , , , DE

    Christian Kanzow

Authors
  1. Christian Kanzow
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received February 24, 1997 / Revised version received September 5, 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kanzow, C. An inexactQP-based method for nonlinear complementarity problems. Numer. Math. 80, 557–577 (1998). https://doi.org/10.1007/s002110050378

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002110050378

Search

Navigation