Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints

Optimization Letters

Volumn 8, Issue 3, 2014, Pages 811-822

  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 program with linear complementarity constraints (QPCC); Quadratic convex reformulation (QCR); Quadratically constrained quadratic program (QCQP); Semidefinite program (SDP)

Indexed keywords

EID: 84894611446     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-013-0647-0     Document Type: Article

References (17)

1. Billionnet, A., Elloumi, E. Lambert, A.: Extending the QCR method to general mixed-integer programs. Math. Program. Ser. B 131, 381-401 (2012). doi: 1. 1007/s10107-010-038-7.
2. Billionnet, A., Elloumi, E., Plateau, M.: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method. Dis. Appl. Math. 157, 1185-1197 (2009).
3. Bai, L., Mitchell, J. E., Pang, J. S.: On convex quadratic programs with linear complementarity constraints. Comput. Opt. Appl. 54, 517-554 (2013). doi: 10. 1007/s10589-012-9497-4.
4. Codato, G., Fischetti, M.: Combinatorial Benders' cuts for mixed-integer linear programming. Oper. Res. 54, 738-766 (2006).
5. Fujie, T., Kojima, M.: Semidefinite programming relaxation for nonconvex quadratic programs. J. Global Opt. 10, 367-380 (1997).
6. 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. Opt. 19, 445-471 (2008).
7. Hu, J., Mitchell, J. E., Pang, J. S., Yu, B.: On linear programs with linear complementarity constraints. J. Global Opt. 53(1), 29-51 (2012).
8. Hu, J., Mitchell, J. E., Pang, J. S.: An LPCC approach to nonconvex quadratic programs. Math. Program. 133(1-2), 243-277 (2012).
9. Jiang, H., Ralph, D.: QPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints. Comput. Opt. Appl. 13, 25-59 (1999).
10. Galli, L., Letchford, A. N.: Extending the QCR method to mixed-integer quadratically constrained programs. Submitted to Math. Program. (2012).
11. Lemaréchal, C., Oustry, F.: Semidefinite relaxations and Lagrangian duality with application to combinatorial optimization. Technical Report RR-3710, INRIA Rhone-Alpes, ZIRST - 655 avenue de l'Europe F-38330 Montbonnot Saint-Martin, France, June (1999).
12. Lemaréchal, C., Oustry, F.: SDP relaxations in combinatorial optimization from a Lagrangian viewpoint. In: Hadjisavvas N, Pardalos P. M., (eds.) Advances in Convex Analysis and Global Optimization, chapter 6, vol. 54, pp. 119-134. Springer, Berlin (2001).
13. Luo, Z. Q., Pang, J. S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, New York (1996).
14. Mitchell, J. E., Pang, J. S., Yu, B.: Obtaining tighter relaxations of mathematical programs with complementarity constraints. In: Modeling and Optimization: Theory and Applications, Proceedings in mathematics and statistics. vol. 21, Springer, Berlin (2012).
15. Poljak, S., Rendl, F., Wolkowicz, H.: A recipe for semidefinite relaxation for (0, 1)-quadratic programming. J. Global Opt. 7, 51-73 (1995).
16. Pang, J. S.: Three modeling paradigms in mathematical programming. Math. Program. Ser. B 125, 297-323 (2010).
17. Toh, K. C., Todd, M. J., Tutuncu, R. H.: SDPT3-a Matlab software package for semidefinite programming. Opt. Meth. Softw. 11, 545-581 (1999).