Abstract
The problem of minimizing a quadratic form over the standard simplex is known as the standard quadratic optimization problem (SQO). It is NP-hard, and contains the maximum stable set problem in graphs as a special case. In this note, we show that the SQO problem may be reformulated as an (exponentially sized) linear program (LP). This reformulation also suggests a hierarchy of polynomial-time solvable LP’s whose optimal values converge finitely to the optimal value of the SQO problem. The hierarchies of LP relaxations from the literature do not share this finite convergence property for SQO, and we review the relevant counterexamples.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bazarraa M.S., Sherali H.D., Shetty C.M. (1993) Nonlinear Programming: Theory and Algorithms. Wiley, New York
Bomze I.M. (2002) Regularity versus degeneracy in dynamics, games, and optimization: a unified approach to different aspects. SIAM Rev. 44(3): 394–414
Bomze I.M., De Klerk E. (2002) Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. Global Optim. 24(2): 163–185
Gaddum J.W. (1958) Linear inequalities and quadratic forms. Pacific J. Math. 8: 411–414
de Klerk E., Laurent M., Parrilo P. (2005) On the equivalence of algebraic approaches to the minimization of forms on the simplex. In: Henrion D., Garulli A. (eds) Positive Polynomials in Control LNCIS, vol. 312. Springer Verlag, Berlin
de Klerk E., Laurent M., Parrilo P. A PTAS for the minimization of polynomials of fixed degree over the simplex. Theoretical Computer Science, to appear
de Klerk E., Maharry J., Pasechnik D.V., Richter B., Salazar G. (2006) Improved bounds for the crossing numbers of K m ,n and K n . SIAM J. Discrete Math. 20(1): 189–202
Faybusovich L. (2003) Global optimization of homogeneous polynomials on the simplex and on the sphere. In: Floudas C., Pardalos P. (eds), Frontiers in Global Optimization. Kluwer Academic Publishers, Dordrecht
de Klerk E., Pasechnik D.V. (2002) Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12: 875–892
Lasserre J.B. (2002) An explicit equivalent positive semidefinite program for nonliner 0-1 programs. SIAM J. Optim. 12: 756–769
Lasserre J.B. (2002) Semidefinite programming vs. LP relaxations for polynomial programming. Math. Oper. Res. 27(2): 347–360
Lasserre J.B. (2004) Polynomial programming: LP relaxations also converge. SIAM J. Optim. 15: 383–393
Laurent M. Semidefinite representations for finite varieties. Math. Program. to appear
Motzkin T.S., Straus E.G. (1965) Maxima for graphs and a new proof of a theorem of Túran. Can. J. Math. 17: 533–540
Nesterov, Yu.: Random walk in a simplex and quadratic optimization over convex polytopes. CORE Discussion Paper 2003/71, CORE-UCL, Louvain-La-Neuve (2003)
Parrilo P.A. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology (2000)
Pólya G. Collected Papers, vol. 2, pp. 309–313. MIT Press, Cambridge, Mass, London (1974)
Powers V., Reznick B. (2001) A new bound for Pólya’s theorem with applications to polynomials positive on polyhedra. J. Pure Appl. Algeb. 164: 221–229
Sherali H.D., Adams W.P. (1992) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discr. Math. 3: 101–112
Zuluaga L.F., Vera J.C., Peña J.F. (2006) LMI approximations for cones of positive semidefinite forms. SIAM J. Optim. 16: 796–817
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
de Klerk, E., Pasechnik, D.V. A linear programming reformulation of the standard quadratic optimization problem. J Glob Optim 37, 75–84 (2007). https://doi.org/10.1007/s10898-006-9037-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-006-9037-9