Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming

Anstreicher, K.M., Burer, S.: Computable representations for convex hulls of low-dimensional quadratic forms. Working paper, Deptartment of Management Sciences, University of Iowa (2007) http://www.optimization-online.org/DB_HTML/2007/02/1586.html

Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Prog. (to appear)

Burer S., Vandenbussche D.: A finite branch–and–bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Prog. 113, 259–282 (2008)

de Angelis P.L., Pardalos P.M., Toraldo G. : Quadratic programming with box constraints. In: Bomze, I.M. et al. (eds) Developments in Global Optimization, pp. 73–95. Kluwer, Dordrecht (1997)

Kim S., Kojima M.: Second order cone programming relaxation of nonconvex quadratic optimization problems. Optim. Methods Softw. 15, 201–204 (2001)

Markót M.C., Csendes T.: A new verified optimization technique for the “packing circles in a unit square” problems. SIAM J. Optim. 16, 193–219 (2005)

Sahinidis N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8, 201–205 (1996)

Sherali H.D., Adams W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer, Dordrecht (1998)

Sherali H.D., Fraticelli B.M.P.: Enhancing RLT relaxations via a new class of semidefinite cuts. J. Glob. Optim. 22, 233–261 (2002)

Sherali H.D., Tuncbilek C.H.: A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Glob. Optim. 7, 1–31 (1995)

So A.M.-C., Ye Y.: Theory of semidefinite programming for sensor network localization. Math. Prog. 109, 367–384 (2007)

Sturm J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11–12, 625–653 (1999)

Szabó P.G., Markót M.C., Csendes T.: Global optimization in geometry—circle packing into the square. In: Audet, C., Hansen, P., Savard, G. (eds) Essays and Surveys in Global Optimization, pp. 233–266. Kluwer, Dordrecht (2005)

Vandenberghe L., Boyd S.: Semidefinite programming. SIAM Rev. 38, 49–95 (1996)

Vandenbussche D., Nemhauser G.: A branch-and-cut algorithm for nonconvex quadratic programming with box constraints. Math. Prog. 102, 559–575 (2005)

Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. Kluwer, Dordrecht (2000)

Ye Y.: Approximating quadratic programming with bound and quadratic constraints. Math. Prog. 84, 219–226 (1999)