A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- 14 November 2017
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 169 (1) , 221-254
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (CMMI-1402052, CMMI-1334639)
- National Science Foundation (CMMI-1334639)
- Air Force Office of Scientific Research (FA9550-15-1-0126)
This publication has 24 references indexed in Scilit:
- On convex quadratic programs with linear complementarity constraintsComputational Optimization and Applications, 2012
- A pivoting algorithm for linear programming with linear complementarity constraintsOptimization Methods and Software, 2012
- On linear programs with linear complementarity constraintsJournal of Global Optimization, 2011
- An LPCC approach to nonconvex quadratic programsMathematical Programming, 2010
- On the Global Solution of Linear Programs with Linear Complementarity ConstraintsSIAM Journal on Optimization, 2008
- Knitro: An Integrated Package for Nonlinear Optimization2006
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium ConstraintsSIAM Journal on Optimization, 2006
- Solving mathematical programs with complementarity constraints as nonlinear programsOptimization Methods and Software, 2004
- Nonlinear programming without a penalty functionMathematical Programming, 2002
- On the Global Convergence of a Filter--SQP AlgorithmSIAM Journal on Optimization, 2002