Skip to main content
Springer Nature Link
Log in

Copositive Optimization

  • Reference work entry
Encyclopedia of Optimization

Article Outline

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Berman A, Shaked-Monderer N (2003) Completely positive matrices. World Scientific, Singapore

    MATH  Google Scholar 

  2. Bomze IM (1998) On standard quadratic optimization problems. J Glob Optim 13:369–387

    Article  MATH  MathSciNet  Google Scholar 

  3. Bomze IM, de Klerk E (2002) Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J Glob Optim 24:163–185

    Article  MATH  Google Scholar 

  4. Bomze IM, Dür M, de Klerk E, Quist A, Roos C, Terlaky T (2000) On copositive programming and standard quadratic optimization problems. J Glob Optim 18:301–320

    Article  MATH  Google Scholar 

  5. Bomze IM, Frommlet F, Locatelli M (2007) The first cut is the cheapest: improving SDP bounds for the clique number via copositivity. Technical Report TR-ISDS 2007-05, University of Vienna, submitted. Available at http://www.optimization-online.org/DB_HTML/2006/08/1443.html. Accessed Nov 2007

  6. Bomze IM, Schachinger W (2007) Multi-standard quadratic optimization problems. Technical Report TR-ISDS 2007-12, University of Vienna, submitted. Available at http://www.optimization-online.org/DB_HTML/2007/11/1843.html. Accessed Mar 2008

  7. Bundfuss S, Dür M (2008) Algorithmic copositivity detection by simplicial partition. Linear Algebr Appl 428:1511–1523

    Article  MATH  Google Scholar 

  8. Burer S (2006) On the copositive representation of binary and continuous nonconvex quadratic programs. Manuscript, Department of Management Sciences, University of Iowa, October (2006). Available at http://www.optimization-online.org/DB_HTML/2006/10/1501.html. Accessed Nov 2007

  9. de Klerk E, Pasechnik DV (2002) Approximation of the stability number of a graph via copositive programming. SIAM J Optim 12:875–892

    Article  MATH  MathSciNet  Google Scholar 

  10. Diananda PH (1967) On non-negative forms in real variables some or all of which are non-negative. Proc Cambridge Philos Soc 58:17–25

    MathSciNet  Google Scholar 

  11. Dukanović I, Rendl F (2007) Semidefinite programming relaxations for graph coloring and maximal clique problems. Math Programm 109:345–365

    Article  MATH  Google Scholar 

  12. Gvozdenović N, Laurent M (2008) The operator Ψ for the chromatic number of a graph. To appear in SIAM J Optim. Available at http://www.optimization-online.org/DB_HTML/2007/02/1592.html. Accessed Mar 2008

  13. Gvozdenović N, Laurent M (2006) Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. Lecture Notes in Computer Science, vol 3509/2005, pp 136–151. Integer Programming and Combinatorial Optimization: 11th International IPCO Conference

    Google Scholar 

  14. Hall M, Newman M (1963) Copositive and completely positive quadratic forms. Proc Cambridge Philos Soc 59:329–339

    MATH  MathSciNet  Google Scholar 

  15. Lasserre JB (2001) Global optimization with polynomials and the problem of moments. SIAM J Optim 11:796–817

    Article  MATH  MathSciNet  Google Scholar 

  16. Lovász L (1979) On the Shannon capacity of a graph. IEEE Trans Inf Theory IT 25:1–7

    Article  MATH  Google Scholar 

  17. McEliece RJ, Rodemich ER, Rumsey HC (1978) The Lovász' bound and some generalizations. J Combinat Inf Syst Sci 3:134–152

    MATH  MathSciNet  Google Scholar 

  18. Motzkin TS (1952) Copositive quadratic forms. Natl Bur Stand Rep 1818 11–22

    Google Scholar 

  19. Motzkin TS, Straus EG (1965) Maxima for graphs and a new proof of a theorem of Turán. Can J Math 17:533–540

    MATH  MathSciNet  Google Scholar 

  20. Murty KG, Kabadi SN (1987) Some NP-complete problems in quadratic and linear programming. Math Programm 39:117–129

    Article  MATH  MathSciNet  Google Scholar 

  21. Parrilo P (2003) Semidefinite programming relaxations for semi-algebraic problems. Math Programm 696B:293–320

    Article  MathSciNet  Google Scholar 

  22. Peña J, Vera J, Zuluaga L (2007) Computing the stability number of a graph via linear and semidefinite programming. SIAM J Optim 18:87–105

    MATH  MathSciNet  Google Scholar 

  23. Povh J, Rendl F (2006) Copositive and semidefinite relaxations of the quadratic assignment problem. Univ. of Klagenfurt, submitted. Available at http://www.optimization-online.org/DB_HTML/2006/10/1502.html. Accessed Nov 2007

  24. Povh J, Rendl F (2007) A copositive programming approach to graph partitioning. SIAM J Optim 18:223–241

    Article  MATH  MathSciNet  Google Scholar 

  25. Schachinger W, Bomze IM (2007) A conic duality Frank–Wolfe type theorem via exact penalization in quadratic optimization. Technical Report 2006-10, ISDS, University of Vienna. to appear in Math Oper Res. Available at http://www.optimization-online.org/DB_HTML/2007/02/1596.html. Accessed Nov 2007

  26. Schrijver A (1979) A comparison of the Delsarte and Lovasz bounds. IEEE Trans Inf Theory IT 25:425–429

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Vienna, Vienna, Austria

    Immanuel M. Bomze

Authors
  1. Immanuel M. Bomze
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Bomze, I.M. (2008). Copositive Optimization . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_99

Download citation

Publish with us

Policies and ethics