A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Formal Foundations for Networking (Dagstuhl Seminar 15071) Holistic Scene Understanding (Dagstuhl Seminar 15081) Limitations of Convex Programming: Lower Bounds on Extended Formulations and Factorization Ranks (Dagstuhl Seminar 15082) Smart Buildings and Smart Grids (Dagstuhl Seminar 15091)
unpublished
Preserved Fulltext
Near-term research goals (2 years out): Scalable IP multicast that works for wide area (short-to-mid-term) Scalable and interoperable communication paths ( ...
Programming: Lower Bounds on Extended Formulations and Factorization Ranks, Dagstuhl Reports, Vol. 5, Issue 2, pp. 109-127 Editors: Hartmut Klauck, Troy Lee, Dirk Oliver Theis, and Rekha R. ...
Positive Semidefinite Rank
Linear algebra invariants over semirings
Extended Formulations: Constructions and Obstructions
Semialgebraic geometry of nonnegative and psd ranks
Lower bounds on semidefinite ...
fatcat:sytmo76kmrb2jdk7za7ce7pwvm
Formal Foundations for Networking (Dagstuhl Seminar 15071) Holistic Scene Understanding (Dagstuhl Seminar 15081) Limitations of Convex Programming: Lower Bounds on Extended Formulations and Factorization Ranks (Dagstuhl Seminar 15082) Smart Buildings and Smart Grids (Dagstuhl Seminar 15091)
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Extended Formulations and
Factorization Ranks (Dagstuhl Seminar 15082)
Hartmut Klauck, Troy Lee, Dirk Oliver Theis, and Rekha R. ...
Holistic Scene Understanding (Dagstuhl Seminar 15081)
Jiří Matas, Vittorio Murino, Laura Leal-Taixé, and Bodo Rosenhahn . . . . . . . . . . . . . 80
Limitations of Convex Programming: Lower Bounds on ...
fatcat:wujbdno6dzcehnnarrxrydngou
Limitations of Convex Programming: Lower Bounds on Extended Formulations and Factorization Ranks
Dagstuhl Reports
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
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. ...
This meeting was a follow-up to the 2013 Dagstuhl seminar 13082: "Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices" organized by Leroy Beasley, Hartmut ...
URL http://arxiv.org/abs/1411.7280v1 License
5 0 8 2
-Limitations of Convex Programming
5 0 8 2
-Limitations of Convex Programming
5 0 8 2
-Limitations of Convex Programming ...
fatcat:myolrwytebc33iyygubqkxxizi
On the linear extension complexity of regular n-gons
2017
Linear Algebra and its Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2015 pre-print arXiv:1505.08031v1 fatcat:z3zsnzhmivhgznqsvxhr6kh7saOther Versions
Our bounds are based on the equivalence between the computation of (i) an extended formulation of size r of a polytope P, and (ii) a rank-r nonnegative factorization of a slack matrix of the polytope P ...
The lower bound is based on an improved bound for the rectangle covering number (also known as the boolean rank) of the slack matrix of the n-gons. ...
Acknowledgement We kinldy acknowledge the participants of the Dagstuhl seminar 15082 on 'Limitations of convex programming: lower bounds on extended formulations and factorization ranks' for insightful ...
doi:10.1016/j.laa.2016.12.023
fatcat:lpymok2tizdi7ijtwrkleham3u