Journal
MATHEMATICAL PROGRAMMING
Volume 169, Issue 1, Pages 221-254Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s10107-017-1208-6
Keywords
Difference-of-convex; Complementarity constraints; Penalty functions; Bilevel programming
Categories
Funding
- U.S. National Science Foundation [CMMI-1334639, CMMI-1402052]
- Air Force Office of Sponsored Research Grant [FA9550-15-1-0126]
Ask authors/readers for more resources
This paper studies the difference-of-convex (DC) penalty formulations and the associated difference-of-convex algorithm (DCA) for computing stationary solutions of linear programs with complementarity constraints (LPCCs). We focus on three such formulations and establish connections between their stationary solutions and those of the LPCC. Improvements of the DCA are proposed to remedy some drawbacks in a straightforward adaptation of the DCA to these formulations. Extensive numerical results, including comparisons with an existing nonlinear programming solver and the mixed-integer formulation, are presented to elucidate the effectiveness of the overall DC approach.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available