Copositive Programming

Samuel Burer ()
Additional contact information
Samuel Burer: University of Iowa

Chapter Chapter 8 in Handbook on Semidefinite, Conic and Polynomial Optimization, 2012, pp 201-218 from Springer

Abstract: Abstract This chapter provides an introduction to copositive programming, which is linear programming over the convex conic of copositive matrices. Researchers have shown that many NP-hard optimization problems can be represented as copositive programs, and this chapter recounts and extends these results.

Keywords: Convex Cone; Quadratic Constraint; Dual Cone; Complementarity Constraint; Positive Matrice (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4614-0769-0_8

Ordering information: This item can be ordered from
http://www.springer.com/9781461407690

DOI: 10.1007/978-1-4614-0769-0_8

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().