Copositive Programming

Bernd Gärtner () and Jiří Matoušek ()
Additional contact information
Bernd Gärtner: ETH Zurich, Institute of Theoretical Computer Science
Jiří Matoušek: Charles University, Department of Applied Mathematics

Chapter Chapter 7 in Approximation Algorithms and Semidefinite Programming, 2012, pp 119-130 from Springer

Abstract: Abstract In this chapter we come back to the topic of cone programming (Chap. 4). So far, we have seen two important classes of cone programs, namely linear and semidefinite programs. Both classes are “easy” in the sense that there are practically efficient algorithms and polynomial-time complexity results, at least under certain conditions (in the semidefinite case).

Date: 2012
References: Add references at CitEc
Citations:

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:sprchp:978-3-642-22015-9_7

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

DOI: 10.1007/978-3-642-22015-9_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().