D.C. versus copositive bounds for standard QP

Journal of Global Optimization

Volumn 33, Issue 2, 2005, Pages 299-312

  Anstreicher, Kurt M ^a   Burer, Samuel ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PROBLEM SOLVING; STABILITY;

COMBINATORIAL PROBLEMS; SEARCH SPACE; STANDARD QUADRATIC PROGRAM (QPS);

QUADRATIC PROGRAMMING;

EID: 27744568236     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-004-4312-0     Document Type: Article

References (11)

1. Bomze, I.M. (2002), Branch-and-bound approaches to standard quadratic optimization problems, Journal of Global Optimization, 22, 27-37.
2. Bomze, I.M. and de Klerk, E. (2002), Solving standard quadratic optimization problems via linear, semidefinite, and copositive programming, Journal of Global Optimization, 24, 163-185.
3. Bomze, I.M., Dür, M., de Klerk, E., Roos, C., Quist A. and Terlaky, T. (2000), On copositive programming and standard quadratic optimization problems, Journal of Global Optimization, 18, 301-320.
4. de Klerk, E. and Pasechnik, D.V. (2002), Approximation of the stability number of a graph via copositve programming, SIAM Journal of Optimization, 12, 875-892.
5. Knuth, D.E. (1994), The sandwich theorem, Electronic J. Combin., 1, 1-48.
6. Motzkin, T.S. and Straus, E.G. (1965), Maxima for graphs and a new proof of a theorem of Túran, Canadian Journal of Mathematics, 17, 533-540.
7. 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.
8. Nesterov, Y. and Nemirovskii, A. (1994), Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia.
9. Parrilo, P.A. (2000), Structured semidefinite programs and semi-algebraic geometry methods in robustness and optimization. Ph.D. thesis, California Institute of Technology, Pasadena, CA.
10. Schrijver, A. (1979), A comparison of the Delsarte and Lovasz bounds, IEEE Transactions of Information Theory, 25, 425-429.
11. Sturm, J.F. (1999), Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Optimization Methods and Software, 11-12, 625-653.