Skip to main content
SpringerLink
Log in

Copositive Programming

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Introduction

Applications

  Complexity of Copositive Programming

Models

  Approximating \( \mathcal{C}_n \) with Linear Matrix Inequalities

References

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. 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 

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

    Article  MATH  Google Scholar 

  3. de Klerk E, Pasechnik D (2001) Approximation of the stability number of a graph via copositive programming. SIAM J Optim 12(4):875–892

    Article  Google Scholar 

  4. Johansson M (1999) Piecewise linear control systems. PhD thesis, Lund Institute of Technology, Lund

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Parrilo PA (2000) Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology, Pasadena, CA, http://www.mit.edu/~parrilo/pubs

  7. Pólya G (1928) Über positive Darstellung von Polynomen, Vierteljschr. Naturforsch Ges Zürich 73:141–145 (Collected Papers, vol 2, MIT Press, Cambridge, MA, London, 1974, 309–313)

    Google Scholar 

  8. Quist AJ, de Klerk E, Roos C, Terlaky T (1998) Copositive relaxation for general quadratic programming. Optim Method Softw 9:185–208

    Article  MATH  Google Scholar 

  9. Renegar J (2001) A Mathematical View of Interior-Point Methods in Convex Optimization. SIAM, Philadelphia

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA

    Stanislav Busygin

Authors
  1. Stanislav Busygin
    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

Busygin, S. (2008). Copositive Programming . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_100

Download citation

Publish with us

Policies and ethics

Search

Navigation