References
- Sturm JF, Zhang S. On cones of nonnegative quadratic functions. Math. Oper. Res. 2003;28:246–267.
- Pardalos PM, Vavasis SA. Quadratic programming with one negative eigenvalue is NP-hard. J. Global Optim. 1991;1:15–22.
- Lu C, Fang S-C, Jin Q, Wang Z, Xing W. KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems. SIAM J. Optim. 2011;21:1475–1490.
- Lu C, Wang Z, Xing W, Fang S-C. Extended canonical duality and conic programming for solving 0–1 quadratic programming problems. J. Ind. Manag. Optim. 2010;6:779–793.
- Burer S, Dong H. Separation and relaxation for cones of quadratic forms. Math. Program. 2013;137:343–370.
- Anstreicher KM, Burer S. Computable representations for convex hulls of low-dimensional quadratic forms. Math. Program. 2010;124:33–43.
- Zheng XJ, Sun XL, Li D. Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation. Math. Program. Ser. B. 2011;129:301–329.
- Anstreicher KM. On convex relaxations for quadratically constrained quadratic programming. Math. Program. 2012;136:233–251.
- Ye Y, Zhang S. New results on quadratic minimization. SIAM J. Optim. 2003;14:245–267.
- Parrilo P. Structured semidefinite programs and semi-algebraic geometry methods in robustness and optimization [PhD thesis]. Pasadena (CA): California Institute of Technology; 2000.
- Bundfuss S, Dür M. An adaptive linear approximation algorithm for copositive programs. SIAM J. Optim. 2009;20:30–53.
- Lasserre JB. Global optimization with polynomials and the problem of moments. SIAM J. Optim. 2001;11:796–817.
- Zuluage LF, Vera J, Pena J. LMI approximations for cones of positive semidefinite forms. SIAM J. Optim. 2006;16:1076–1091.
- Boyd S, Ghaoui LEI, Feron E, Balakrishnan V. Linear matrix inequalities in system and control theory. SIAM Studies in Applied Mathematics. Philadelphia (PA): SIAM; 1994.
- Sherali HD, Liberti L. Reformulation-Linearization methods for global optimization. Available from: http://www.lix.polytechnique.fr/liberti/rlt_encopt2.pdf.
- Rockafellar RT. Convex analysis. Princeton (NJ): Princeton University Press; 1970.
- Anstreicher KM. Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Global Optim. 2009;43:471–484.
- Sturm JF. Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optim. Method Softw. 1999;11:625–653.