𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strong Duality for Semidefinite Programming

✍ Scribed by Ramana, Motakuri V.; Tunçel, Levent; Wolkowicz, Henry

Book ID
118204313
Publisher
Society for Industrial and Applied Mathematics
Year
1997
Tongue
English
Weight
343 KB
Volume
7
Category
Article
ISSN
1052-6234

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms and Semidefinit
Approximation Algorithms and Semidefinite Programming || Duality and Cone Programming
✍ Gärtner, Bernd; Matousek, Jiri 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 993 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