On convex quadratic programs with linear complementarity constraints

Computational Optimization and Applications

Volumn 54, Issue 3, 2013, Pages 517-554

  Bai, Lijie ^a   Mitchell, John E ^a   Pang, Jong Shi ^b  

^a Research Rensselaer Polytechnic Institute   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Convex quadratic programming; Logical Benders decomposition; Satisfiability constraints; Semidefinite programming

Indexed keywords

COMPLEMENTARITY CONSTRAINT; COMPUTATIONAL RESULTS; CONVEX QUADRATIC PROGRAMMING; LINEAR COMPLEMENTARITY; LOGICAL BENDERS DECOMPOSITIONS; MIXED INTEGER QUADRATIC PROGRAM; SATISFIABILITY; SEMI-DEFINITE PROGRAMMING;

FORMAL LOGIC; INTEGER PROGRAMMING; MATRIX ALGEBRA;

CONVEX PROGRAMMING;

EID: 84876494037     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-012-9497-4     Document Type: Article

References (21)

1. Bienstock, D.: Eigenvalue techniques for proving bounds for convex objective, nonconvex programs. In: IPCO, vol. 29 (2010)
2. Candès, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717-772 (2009)
3. Eaves, B.C.: On quadratic programing. Manag. Sci. 17, 698-711 (1971)
4. Fazel, M.: Matrix rank minimization with applications. Ph.D. thesis, Electrical Engineering Department, Stanford University (2002)
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)
6. Han, Z.: A SAT solver implemented in MATLAB http://www.mathworks.com/ matlabcentral/fileexchange/22284-satisfiability-solver Accessed September 2011
7. Hooker, J.N.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, New York (2000)
8. Hooker, J.N.: Integrated Methods for Optimization. Springer, New York (2006)
9. Hooker, J.N., Ottosson, G.: Logic-based benders decomposition. Math. Program. 96, 33-60 (2003)
10. Hu, J.: On linear programs with linear complementarity constraints. Ph.D. thesis, Mathematical Sciences, Rensselaer Polytechnic Institute (2009)
11. Hu, J., Mitchell, J.E., Pang, J.S., Bennett, K.P., Kunapuli, G.: On the global resolution of linear programs with linear complementarity constraints. SIAM J. Optim. 19, 445-471 (2008)
12. Hu, J., Mitchell, J.E., Pang, J.S.: An LPCC approach to nonconvex quadratic programs. Math. Program. 133, 243-277 (2012)
13. Hu, J., Mitchell, J.E., Pang, J.S., Yu, B.: On linear programs with linear complementarity constraints. J. Glob. Optim. 53, 29-51 (2012)
14. Jiang, H., Ralph, D.: QPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints. Comput. Optim. Appl. 13, 25-59 (1999)
15. KNITRO User's Manual Version 6.0. http://www.ziena.com/docs/Knitro60- UserManual.pdf. Accessed February 2012
16. Luo, Z.Q., Pang, J.S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, New York (1996)
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)
19. Pang, J.S.: Three modeling paradigms in mathematical programming. Math. Program. 125, 297-323 (2010)
20. Toh, K.C., Todd, M.J., Tutuncu, R.H.: SDPT3 - a Matlab software package for semidefinite programming. Optim. Methods Softw. 11, 545-581 (1999)
21. Yu, B.: A branch and cut approach to linear programs with linear complementarity constraints. Ph.D. thesis, Mathematical Sciences, Rensselaer Polytechnic Institute (2011)