Skip to main content
SpringerLink
Log in

Feasible descent algorithms for mixed complementarity problems

  • Published:
Mathematical Programming Submit manuscript

Abstract.

In this paper we consider a general algorithmic framework for solving nonlinear mixed complementarity problems. The main features of this framework are: (a) it is well-defined for an arbitrary mixed complementarity problem, (b) it generates only feasible iterates, (c) it has a strong global convergence theory, and (d) it is locally fast convergent under standard regularity assumptions. This framework is applied to the PATH solver in order to show viability of the approach. Numerical results for an appropriate modification of the PATH solver indicate that this framework leads to substantial computational improvements.

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. University of Wisconsin – Madison, Computer Sciences Department, 1210 West Dayton Street, Madison, WI 53706, USA, e-mail: ferris@cs.wisc.edu, , , , , , US

    Michael C. Ferris

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

    Christian Kanzow

  3. University of Wisconsin – Madison, Computer Sciences Department, 1210 West Dayton Street, Madison, WI 53706, USA, e-mail: tmunson@cs.wisc.edu, , , , , , US

    Todd S. Munson

Authors
  1. Michael C. Ferris
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Kanzow
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Todd S. Munson
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received April 9, 1998 / Revised version received November 23, 1998¶Published online March 16, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ferris, M., Kanzow, C. & Munson, T. Feasible descent algorithms for mixed complementarity problems. Math. Program. 86, 475–497 (1999). https://doi.org/10.1007/s101070050101

Download citation

  • Issue Date:

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

Search

Navigation