An adaptive linear approximation algorithm for copositive progra ms

SIAM Journal on Optimization

Volumn 20, Issue 1, 2009, Pages 30-53

  Bundfuss, Stefan ^a   Dür, Mirjam ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Approximation algorithms; Copositive cone; Copositive programming; Quadratic programming

Indexed keywords

APPROXIMATION SCHEME; BINARY OPTIMIZATION; COMBINATORIAL PROBLEM; COPOSITIVE; COPOSITIVE PROGRAMMING; LINEAR APPROXIMATIONS; LINEAR OPTIMIZATION PROBLEMS; MAXIMUM CLIQUE PROBLEMS; NONCONVEX; NUMERICAL EXPERIMENTS; OBJECTIVE FUNCTIONS; OUTER APPROXIMATION; QUADRATIC PROBLEM;

ADAPTIVE ALGORITHMS; OPTIMIZATION; QUADRATIC PROGRAMMING;

APPROXIMATION ALGORITHMS;

EID: 70450198601     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/070711815     Document Type: Article

References (22)

1. A. BERMAN AND N. SHAKED-MONDERER, Completely Positive Matrices, World Scientific, River Edge, NJ, 2003.
2. A. BERMAN AND U. ROTHBLUM, A Note on the Computation of the CP-Rank, Linear Algebra Appl., 419 (2006), pp. 1-7.
3. I. M. BOMZE, M. DÜR, E. DE KLERK, C. ROOS, A. J. QUIST, AND T. TERLAKY, On copositive programming and standard quadratic optimization problems, J. Global Optim., 18 (2000), pp. 301-320.
4. I. M. BOMZE AND E. DE KLERK, Solving standard quadratic optimization problems via linear, semidefinite and copositive programming, J. Global Optim., 24 (2002), pp. 163-185.
5. S. BUNDFUSS AND M. DÜR, Algorithmic copositivity detection by simplicial partition, Linear Algebra Appl., 428 (2008), pp. 1511-1523.
6. S. BURER, On the copositive representation of binary and continuous nonconvex quadratic programs, Math. Program., in print. Available at http://dx.doi.org/10.1007/s10107-008-0223-z
7. G. DANNINGER, A recursive algorithm for determining (strict) copositivity of a symmteric matrix, Methods Oper. Res., 62 (1990), pp. 45-52.
8. DIMACS, Second DIMACS Challenge (1992-1993). Test instances available at: http://dimacs. rutgers.edu/Challenges/.
9. I. DUKANOVIC AND F. RENDL, Copositive programming motivated bounds on the stability and the chromatic numbers, Math. Program., in print. Available at http://dx.doi.org/10.1007/s10107-008-0233-x
10. M. DÜR AND G. STILL, Interior points of the completely positive cone, Electronic J. Linear Algebra, 17 (2008), pp. 48-53.
11. G. EICHFELDER AND J. JAHN, Set-semidefinite optimization, J. Convex Analysis, 15 (2008), pp. 767-801.
12. R. HORST, On generalized bisection of n-simplices, Math. Comput., 218 (1997), pp. 691-698.
13. F. JARRE, I. M. BOMZE, AND F. RENDL, Quadratic Factorization Heuristics for Copositive Programming, working paper presented at the Czech-French-German Conference on Optimization, September 2007, University of Heidelberg.
14. * certificates, Report, Mathe-matisches Institut, Universität Düsseldorf, 2008. Available at: http://www.optimization-online.org/DB-HTML/ 2008/05/1969.html.
15. E. DE KLERK AND D. V. PASECHNIK, Approximation of the stability number of a graph via copositive programming, SIAM J. Optim., 12 (2002), pp. 875-892.
16. K. G. MURTY AND S. N. KABADI, Some NP-complete problems in quadratic and nonlinear programming, Math. Program., 39 (1987), pp. 117-129.
17. P. PARRILO, Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization, Ph. D. Dissertation, California Institute of Technology, 2000. Available at: http://etd.caltech.edu/etd/ available/etd-05062004-055516/.
18. J. PEÑA, J. VERA, AND L. ZULUAGA, Computing the stability number of a graph via linear and semidefinite programming, SIAM J. Optim., 18 (2007), pp. 87-105.
19. J. POVH AND F. RENDL, A copositive programming approach to graph partitioning, SIAM J. Optim., 18 (2007), pp. 223-241.
20. J. POVH AND F. RENDL, Copositive and semidefinite relaxations of the quadratic assignment problem, to appear. Preprint available at: http://www.optimization-online.org/DB-HTML/2006/10/1502.html.
21. A. J. QUIST, E. DE KLERK, C. ROOS, AND T. TERLAKY, Copositive relaxation for general quadratic programming, Optim. Methods Software, 9 (1998), pp. 185-208.
22. M. TAWARMALANI AND N. V. SAHINIDIS, Global optimization of mixed-integer nonlinear programs: A theoretical and computational study, Math. Program., 99 (2004), pp. 563-591.