Complementarity constraints as nonlinear equations: Theory and numerical experience
Sven Leyffer ()
Additional contact information
Sven Leyffer: Argonne National Laboratory
A chapter in Optimization with Multivalued Mappings, 2006, pp 169-208 from Springer
Abstract:
Summary Recently, it has been shown that mathematical programs with complementarity constraints (MPCCs) can be solved efficiently and reliably as nonlinear programs. This paper examines various nonlinear formulations of the complementarity constraints. Several nonlinear complementarity functions are considered for use in MPCC. Unlike standard smoothing techniques, however, the reformulations do not require the control of a smoothing parameter. Thus they have the advantage that the smoothing is exact in the sense that Karush-Kuhn-Tucker points of the reformulation correspond to strongly stationary points of the MPCC. A new exact smoothing of the well-known min function is also introduced and shown to possess desirable theoretical properties. It is shown how the new formulations can be integrated into a sequential quadratic programming solver, and their practical performance is compared on a range of test problems.
Keywords: Nonlinear programming; SQP; MPCC; complementarity constraints; NCP functions (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations: View citations in EconPapers (3)
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-34221-4_9
Ordering information: This item can be ordered from
http://www.springer.com/9780387342214
DOI: 10.1007/0-387-34221-4_9
Access Statistics for this chapter
More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().