Cambridge university / Massachusetts Institute of Technology / Laboratory For Information and Decision Systems / /
Person
Rekha R. Thomas / Ken Ono / Etienne De Klerk / Henry Wolkowicz / Leiba Rodman / James Anderson / Stephen Prajna / Hayato Waki / Johan Löfberg / Victor Baston / Masakazu Muramatsu / Mi / Dmitriy Drusvyatskiy / James Haglund / Dai Our / Dimitris Bertsimas / Gábor Pataki / Igor Dukanovic / Ai / Peter Seiler / Roger A Horn / Grigoriy Blekherman / David G Wagner / Michael M. Sørensen / Jiawang Nie / Frank Permenter / Kazuhide Nakata / Robert M. Freund / Pablo A. Parrilo / Masakazu Kojima / James Demmel / Kazuo Murota / Xia Our / Karin Gatermann / Sunyoung Kim / Frank Vallentin / Giorgio Valmorbida / Pete Seiler / Jos F. Sturm / Antonis Papachristodoulou / Mituhiro Fukuda / Adam N. Letchford / Charles R Johnson / Peter Lancaster / Franz Rendl / Israel Gohberg / /
Position
Prime Minister / condition PM / equation PM / projections PM / General / inclusion PM / A. General / map PM / /
Finding sparse, equivalent SDPs using linear programming and combinatorial techniques Frank Permenter Abstract— We present a new method for simplifying SDPs that blends aspects of symmetry reduction with sparsity explo