Search Results

Documents authored by Theis, Dirk Oliver


Document
Limitations of Convex Programming: Lower Bounds on Extended Formulations and Factorization Ranks (Dagstuhl Seminar 15082)

Authors: Hartmut Klauck, Troy Lee, Dirk Oliver Theis, and Rekha R. Thomas

Published in: Dagstuhl Reports, Volume 5, Issue 2 (2015)


Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15082 "Limitations of convex programming: lower bounds on extended formulations and factorization ranks" held in February 2015. Summaries of a selection of talks are given in addition to a list of open problems raised during the seminar.

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)


Copy BibTex To Clipboard

@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-dev.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}
}
Document
Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082)

Authors: LeRoy B. Beasley, Hartmut Klauck, Troy Lee, and Dirk Oliver Theis

Published in: Dagstuhl Reports, Volume 3, Issue 2 (2013)


Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 13082 "Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices".

Cite as

LeRoy B. Beasley, Hartmut Klauck, Troy Lee, and Dirk Oliver Theis. Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082). In Dagstuhl Reports, Volume 3, Issue 2, pp. 127-143, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)


Copy BibTex To Clipboard

@Article{beasley_et_al:DagRep.3.2.127,
  author =	{Beasley, LeRoy B. and Klauck, Hartmut and Lee, Troy and Theis, Dirk Oliver},
  title =	{{Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082)}},
  pages =	{127--143},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{3},
  number =	{2},
  editor =	{Beasley, LeRoy B. and Klauck, Hartmut and Lee, Troy and Theis, Dirk Oliver},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.3.2.127},
  URN =		{urn:nbn:de:0030-drops-40191},
  doi =		{10.4230/DagRep.3.2.127},
  annote =	{Keywords: nonnegative rank, combinatorial optimization, communication complexity, extended formulation size}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail