Document Open Access Logo

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

Authors Hartmut Klauck, Troy Lee, Dirk Oliver Theis, Rekha R. Thomas and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.5.2.109.pdf
  • Filesize: 0.91 MB
  • 19 pages

Document Identifiers

Author Details

Hartmut Klauck
Troy Lee
Dirk Oliver Theis
Rekha R. Thomas
and all authors of the abstracts in this report

Cite AsGet BibTex

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)
https://doi.org/10.4230/DagRep.5.2.109

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.
Keywords
  • Convex optimization
  • extended formulations
  • cone rank
  • positive semidefinite rank
  • nonnegative rank
  • quantum communication complexity
  • real algebraic geometry

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
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