Abstract
The standard quadratic program (QPS) is minxεΔxTQx, where \(\Delta\subset\Re^n\) is the simplex Δ = {x ⩽ 0 ∣ ∑ ni=1 xi = 1}. QPS can be used to formulate combinatorial problems such as the maximum stable set problem, and also arises in global optimization algorithms for general quadratic programming when the search space is partitioned using simplices. One class of ‘d.c.’ (for ‘difference between convex’) bounds for QPS is based on writing Q=S−T, where S and T are both positive semidefinite, and bounding xT Sx (convex on Δ) and −xTx (concave on Δ) separately. We show that the maximum possible such bound can be obtained by solving a semidefinite programming (SDP) problem. The dual of this SDP problem corresponds to adding a simple constraint to the well-known Shor relaxation of QPS. We show that the max d.c. bound is dominated by another known bound based on a copositive relaxation of QPS, also obtainable via SDP at comparable computational expense. We also discuss extensions of the d.c. bound to more general quadratic programming problems. For the application of QPS to bounding the stability number of a graph, we use a novel formulation of the Lovasz ϑ number to compare ϑ, Schrijver’s ϑ′, and the max d.c. bound.
Similar content being viewed by others
References
I.M. Bomze (2002) ArticleTitleBranch-and-bound approaches to standard quadratic optimization problems Journal of Global Optimization 22 27–37 Occurrence Handle10.1023/A:1013886408463
I.M. Bomze E. Klerk Particlede (2002) ArticleTitleSolving standard quadratic optimization problems via linear, semidefinite, and copositive programming Journal of Global Optimization 24 163–185 Occurrence Handle10.1023/A:1020209017701
I.M. Bomze M. Dür E. Klerk Particlede C. Roos A. Quist T. Terlaky (2000) ArticleTitleOn copositive programming and standard quadratic optimization problems Journal of Global Optimization 18 301–320 Occurrence Handle10.1023/A:1026583532263
E. Klerk Particlede D.V. Pasechnik (2002) ArticleTitleApproximation of the stability number of a graph via copositve programming SIAM Journal of Optimization 12 875–892 Occurrence Handle10.1137/S1052623401383248
D.E. Knuth (1994) ArticleTitleThe sandwich theorem Electronic J. Combin. 1 1–48
T.S. Motzkin E.G. Straus (1965) ArticleTitleMaxima for graphs and a new proof of a theorem of Túran Canadian Journal of Mathematics 17 533–540
Nesterov, Y.E. (1999), Global quadratic optimization on the sets with simplex structure. Discussion Paper 9915, Center for Operations Research and Econometrics (CORE), Catholic University of Louvain, Louvain-la-Neuve, Belgium.
Y. Nesterov A. Nemirovskii (1994) Interior-Point Polynomial Algorithms in Convex Programming SIAM Philadelphia
P.A. Parrilo (2000) Structured semidefinite programs and semi-algebraic geometry methods in robustness and optimization California Institute of Technology Pasadena, CA
A. Schrijver (1979) ArticleTitleA comparison of the Delsarte and Lovasz bounds IEEE Transactions of Information Theory 25 425–429 Occurrence Handle10.1109/TIT.1979.1056072
J.F. Sturm (1999) ArticleTitleUsing SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones Optimization Methods and Software 11–12 625–653
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Anstreicher, K.M., Burer, S. D.C. Versus Copositive Bounds for Standard QP. J Glob Optim 33, 299–312 (2005). https://doi.org/10.1007/s10898-004-4312-0
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10898-004-4312-0