𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Phase recovery, MaxCut and complex semidefinite programming

✍ Scribed by Waldspurger, Irène; d’Aspremont, Alexandre; Mallat, Stéphane

Book ID
125352387
Publisher
Springer-Verlag
Year
2013
Tongue
English
Weight
563 KB
Volume
149
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms and Semidefinit
Approximation Algorithms and Semidefinite Programming || Introduction: MaxCut Via Semidefinite Programming
✍ Gärtner, Bernd; Matousek, Jiri 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 280 KB

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexit

Approximation Algorithms and Semidefinit
Approximation Algorithms and Semidefinite Programming || Lower Bounds for the Goemans–Williamson MaxCut Algorithm
✍ Gärtner, Bernd; Matousek, Jiri 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 412 KB

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexit