Search Results

Abstract

Cite as

Hartmut Klauck, Troy Lee, Dirk Oliver Theis, and Rekha R. Thomas. Limitations of Convex Programming: Lower Bounds on Extended Formulations and Factorization Ranks (Dagstuhl Seminar 15082). In Dagstuhl Reports, Volume 5, Issue 2, pp. 109-127, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

@Article{klauck_et_al:DagRep.5.2.109,
  author =	{Klauck, Hartmut and Lee, Troy and Theis, Dirk Oliver and Thomas, Rekha R.},
  title =	{{Limitations of Convex Programming: Lower Bounds on Extended Formulations and Factorization Ranks (Dagstuhl Seminar 15082)}},
  pages =	{109--127},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{5},
  number =	{2},
  editor =	{Klauck, Hartmut and Lee, Troy and Theis, Dirk Oliver and Thomas, Rekha R.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.2.109},
  URN =		{urn:nbn:de:0030-drops-50480},
  doi =		{10.4230/DagRep.5.2.109},
  annote =	{Keywords: Convex optimization, extended formulations, cone rank, positive semidefinite rank, nonnegative rank, quantum communication complexity, real algebraic geometry}
}