Approximating SDP solutions with linear programs and simplex-like algorithm
Résumé
we present an algorithm to compute upper bounds to semidefinite programs thanks to a hierarchy of linear programs. At each iteration, we find an optimal basis for the next iteration as it is the case in the simplex algorithm for the linear case
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|