On convex quadratic programs with linear complementarity constraints
- 677 Downloads
The paper shows that the global resolution of a general convex quadratic program with complementarity constraints (QPCC), possibly infeasible or unbounded, can be accomplished in finite time. The method constructs a minmax mixed integer formulation by introducing finitely many binary variables, one for each complementarity constraint. Based on the primal-dual relationship of a pair of convex quadratic programs and on a logical Benders scheme, an extreme ray/point generation procedure is developed, which relies on valid satisfiability constraints for the integer program. To improve this scheme, we propose a two-stage approach wherein the first stage solves the mixed integer quadratic program with pre-set upper bounds on the complementarity variables, and the second stage solves the program outside this bounded region by the Benders scheme. We report computational results with our method. We also investigate the addition of a penalty term y T Dw to the objective function, where y and w are the complementary variables and D is a nonnegative diagonal matrix. The matrix D can be chosen effectively by solving a semidefinite program, ensuring that the objective function remains convex. The addition of the penalty term can often reduce the overall runtime by at least 50 %. We report preliminary computational testing on a QP relaxation method which can be used to obtain better lower bounds from infeasible points; this method could be incorporated into a branching scheme. By combining the penalty method and the QP relaxation method, more than 90 % of the gap can be closed for some QPCC problems.
KeywordsConvex quadratic programming Logical Benders decomposition Satisfiability constraints Semidefinite programming
Our thanks to two anonymous referees for their helpful and constructive comments.
- 1.Bienstock, D.: Eigenvalue techniques for proving bounds for convex objective, nonconvex programs. In: IPCO, vol. 29 (2010) Google Scholar
- 4.Fazel, M.: Matrix rank minimization with applications. Ph.D. thesis, Electrical Engineering Department, Stanford University (2002) Google Scholar
- 5.Fazel, M., Hindi, H., Boyd, S.: Rank minimization and applications in system theory. In: Proceedings of the 2004 American Control Conference, Boston, Massachusetts, 30–July 2, 2004, pp. 3273–3278 (2004) Google Scholar
- 6.Han, Z.: A SAT solver implemented in MATLAB http://www.mathworks.com/matlabcentral/fileexchange/22284-satisfiability-solver Accessed September 2011
- 8.Hooker, J.N.: Integrated Methods for Optimization. Springer, New York (2006) Google Scholar
- 10.Hu, J.: On linear programs with linear complementarity constraints. Ph.D. thesis, Mathematical Sciences, Rensselaer Polytechnic Institute (2009) Google Scholar
- 15.KNITRO User’s Manual Version 6.0. http://www.ziena.com/docs/Knitro60_UserManual.pdf. Accessed February 2012
- 17.MacMPEC Test Problems. http://wiki.mcs.anl.gov/leyffer/index.php/MacMPEC. Accessed September 2011
- 18.Mitchell, J.E., Pang, J.S., Yu, B.: Obtaining tighter relaxations of linear programs with complementarity constraints. In: Modeling and Optimization: Theory and Applications. Springer Proceedings in Mathematics and Statistics, vol. 21 (2012) Google Scholar
- 21.Yu, B.: A branch and cut approach to linear programs with linear complementarity constraints. Ph.D. thesis, Mathematical Sciences, Rensselaer Polytechnic Institute (2011) Google Scholar