Copositive programming - A survey

Recent Advances in Optimization and its Applications in Engineering

Volumn , Issue , 2010, Pages 3-20

  Dür, Mirjam ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79953706040     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-642-12598-0_1     Document Type: Chapter

References (56)

1. Andersson L.E., Chang G.Z., Elfving T., Criteria for copositive matrices using simplices and barycentric coordinates. Linear Algebra and its Applications 220(1995): 9-30.
2. Anstreicher K.M., Burer S., D.C. versus copositive bounds for standard QP. Journal of Global Optimization 33(2005): 199-312.
3. Baston V.J., Extreme copositive quadratic forms. Acta Arithmetica 15(1969): 319-327.
4. Baumert L.D., Extreme copositive quadratic forms. Pacific Journal of Mathematics 19(1966): 197-204.
5. Baumert L.D., Extreme copositive quadratic forms II. Pacific Journal of Mathematics 20(1967): 1-20.
6. Berman A., Shaked-Monderer N., Completely positive matrices, World Scientific, 2003.
7. Berman A., Rothblum, U., A note on the computation of the cp-rank. Linear Algebra and its Applications 419(2006), 1-7.
8. Berman A., Hershkowitz D., Combinatorial results on completely positive matrices. Linear Algebra and its Applications 95(1987), 111-125.
9. Bomze I.M., Building a completely positive factorization. Technical Report TRISDS 2009-06, Department of Statistics and Decision Support Systems, University of Vienna, Austria. Online at http://www.optimization-online.org/DB- HTML/2009/08/2381.html
10. Bomze I.M., Linear-time copositivity detection for tridiagonal matrices and extension to block-tridiagonality, SIAM Journal on Matrix Analysis and Applications 21(2000): 840-848.
11. Bomze I.M., Dür M., de Klerk E., Roos C., Quist A.J., Terlaky T., On copositive programming and standard quadratic optimization problems, Journal of Global Optimization 18(2000): 301-320.
12. Bomze I.M., de Klerk E., Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. Journal of Global Optimization 24(2002): 163-185.
13. Bomze I.M., Jarre F., A note on Burer's copositive representation of mixedbinary QPs. Technical Report TR-ISDS 2009-04, Department of Statistics and Decision Support Systems, University of Vienna, Austria. Online at http://www.optimization-online.org/DB-HTML/2009/08/2368.html
14. Bomze I.M., Jarre F., Rendl F., Quadratic factorization heuristics for copositive programming. Technical Report TR-ISDS 2009-08, Department of Statistics and Decision Support Systems, University of Vienna, Austria. Online at http://www.optimization-online.org/DB-HTML/2009/10/2426.html
15. Bomze I.M., Schachinger W., Multi-standard quadratic optimization: interior point methods and cone programming reformulation. Computational Optimization and Applications 45(2009): 237-256.
16. Bundfuss S., Copositive matrices, copositive programming, and applications. Ph.D. Dissertation, TU Darmstadt 2009. Online at http://www3.mathematik.tu-darmstadt.de/index.php?id=483
17. Bundfuss S., Dür M.: An adaptive linear approximation algorithm for copositive programs. SIAM Journal on Optimization 20(2009): 30-53.
18. Bundfuss S., Dür M.: Algorithmic copositivity detection by simplicial partition. Linear Algebra and its Applications 428(2008): 1511-1523.
19. Burer S., On the copositive representation of binary and continuous nonconvex quadratic programs. Mathematical Programming 120(2009): 479-495.
20. Burer S., Anstreicher K.M., Dür M., The difference between 5 × 5 doubly nonnegative and completely positive matrices. Linear Algebra and its Applications 431(2009): 1539-1552.
21. Cottle R.W., Habetler G.J., Lemke C.E., On classes of copositive matrices. Linear Algebra and its Applications 3(1970): 295-310.
22. Danninger G., A recursive algorithm for determining (strict) copositivity of a symmetric matrix. Methods of Operations Research 62(1990): 45-52.
23. de Klerk E., Pasechnik D.V., Approximation of the stability number of a graph via copositive programming, SIAM Journal on Optimiaztion 12(2002): 875-892.
24. Dickinson P.J.C., An improved characterisation of the interior of the completely positive cone. Preprint (2010).
25. Drew J.H., Johnson C.R., Loewy R., Completely positive matrices associated with M-matrices Linear Algebra and Multilinear Algebra 37(1994): 303-310.
26. Dukanovic I., Rendl F., Copositive programming motivated bounds on the stability and the chromatic numbers. Mathematical Programming 121(2010): 249- 268.
27. Dür M., Still G., Interior points of the completely positive cone. Electronic Journal of Linear Algebra 17(2008): 48-53.
28. Eichfelder G., Jahn J., Set-semidefinite optimization. Journal of Convex Analysis 15(2008): 767-801.
29. Feng Y.Y., Li P., Criteria for copositive matrices of order four. Linear Algebra and its Applications 194(1993), 109-124.
30. Gvozdenović N., Laurent M., The operator for the chromatic number of a graph. SIAM Journal on Optimization 19(2008), 572-591.
31. Hall Jr. M., Newman M., Copositive and completely positive quadratic forms. Proceedings of the Cambridge Philosophical Society 59(1963): 329-33.
32. Haynsworth E., Hoffman A.J., Two remarks on copositive matrices. Linear Algebra and its Applications 2(1969): 387-392.
33. Hiriart-Urruty J.B., Seeger A., A variational approach to copositive matrices. Forthcoming in SIAM Review.
34. Hoffman A.J., Pereira F., On copositive matrices with -1; 0; 1 entries. Journal of Combinatorial Theory 14(1973): 302-309.
35. Ikramov K.D., Linear-time algorithm for verifying the copositivity of an acyclic matrix. Computational Mathematics and Mathematical Physics 42(2002): 1701- 1703.
36. Ikramov K.D., Savel'eva N., Conditionally definite matrices. Journal of Mathematical Sciences 99(2000): 1-50.
37. Jarre F., Schmallowsky K., On the computation of C* certificates. Journal of Global Optimization 45(2009): 281-296.
38. Johnson C.R., Reams R., Spectral theory of copositive matrices. Linear Algebra and its applications 395(2005): 275-281.
39. Kaykobad M., On nonnegative factorization of matrices. Linear Algebra and its applications 96(1987), 27-33.
40. Kogan N., Berman A., Characterization of completely positive graphs. Discrete Mathematics 114(1993): 297-304.
41. Maxfield J.E., Minc H., On the matrix equation X 0 X = A, Proceedings of the Edinburgh Mathematical Society, 13:125-129, 1962/1963.
42. National Bureau of Standards, Report 1818. Quarterly Report, April through June 1952.
43. Motzkin, T.S., Straus, E.G., Maxima for graphs and a new proof of a theorem of Turan, Canadian Journal of Mathematics 17(1965), 533-540.
44. Murty K.G., Kabadi S.N., Some NP-complete problems in quadratic and nonlinear programming. Mathematical Programming 39(1987): 117-129.
45. Natarajan K., Teo C.P., Zheng Z., Mixed zero-one linear programs under objective uncertainty: a completely positive representation. Preprint. Online at http://www.optimization-online.org/DB-HTML/2009/08/2365.html
46. Nesterov Y., Nemirovskii A., Interior-point polynomial algorithms in convex programming, SIAM Studies in Applied Mathematics
47. Parrilo P., 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/
48. Peña J., Vera J., Zuluaga L., Computing the stability number of a graph via linear and semidefinite programming, SIAM Journal on Optimization 18(2007): 87-105.
49. Pólya G., Über positive Darstellung von Polynomen. Vierteljahresschrift der naturforschenden Gesellschaft in Zürich 73(1928): 141-145.
50. Povh J., Rendl F., Copositive and semidefinite relaxations of the Quadratic Assignment Problem. Discrete Optimization 6(2009): 231-241.
51. Povh J., Rendl F., A copositive programming approach to graph partitioning. SIAM Journal on Optimization 18(2007): 223-241.
52. Preisig J.C., Copositivity and the minimization of quadratic functions with nonnegativity and quadratic equality constraints. SIAM Journal on Control and Optimization 34(1996): 1135-1150.
53. Quist A.J., de Klerk E., Roos C., Terlaky T., Copositive relaxation for general quadratic programming. Optimization Methods and Software 9(1998): 185-208.
54. Sponsel J., Bundfuss S., Dür, M., Testing copositivity using semidefinitness. Manuscript in preparation (2009).
55. Tawarmalani M., Sahinidis N.V., Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Mathematical Programming 99(2004): 563-591.
56. Yildirim E.A., On the accuracy of uniform polyhedral approximations of the copositive cone. Preprint. Online at http://www.optimization-online.org/DB- HTML/2009/07/2342.html