Crossref
Rank conditions for exactness of semidefinite relaxations in polynomial optimization
Mathematical Programming · 21.08.2026
DOI: 10.1007/s10107-026-02417-2 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Programming, online erschienen am 21.08.2026. Verfasst von Jean B. Lasserre. Die Arbeit nennt 18 Literaturangaben. Gefördert von: Agence Nationale de la Recherche, HORIZON EUROPE Marie Sklodowska-Curie Actions.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Agence Nationale de la Recherche
- HORIZON EUROPE Marie Sklodowska-Curie Actions
Zitieren
APA
Lasserre, J. B. (2026). Rank conditions for exactness of semidefinite relaxations in polynomial optimization. Mathematical Programming. https://doi.org/10.1007/s10107-026-02417-2
Vancouver
Lasserre JB. Rank conditions for exactness of semidefinite relaxations in polynomial optimization. Mathematical Programming. 2026. doi:10.1007/s10107-026-02417-2
BibTeX
@article{Lasserre2026,
author = {Lasserre, Jean B.},
title = {Rank conditions for exactness of semidefinite relaxations in polynomial optimization},
journal = {Mathematical Programming},
year = {2026},
doi = {10.1007/s10107-026-02417-2}
}
EUVIMED