pdf-format: |
|
@Article{klauck_et_al:DR:2015:5048, author = {Hartmut Klauck and Troy Lee and Dirk Oliver Theis and Rekha R. Thomas}, 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 = {Hartmut Klauck and Troy Lee and Dirk Oliver Theis and Rekha R. Thomas}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5048}, 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 } }
Keywords: | Convex optimization, extended formulations, cone rank, positive semidefinite rank, nonnegative rank, quantum communication complexity, real algebraic | |
Freie Schlagwörter (englisch): | geometry | |
Seminar: | Dagstuhl Reports, Volume 5, Issue 2 | |
Issue date: | 2015 | |
Date of publication: | 15.07.2015 |