On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
Year of publication: |
2019
|
---|---|
Authors: | Ahmadi, Amir Ali ; Hall, Georgina |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 44.2019, 4, p. 1192-1207
|
Subject: | Positivstellensätze | polynimial optimizattion | convex optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Hierarchie | Hierarchy |
-
On the hardest problem formulations for the 0/1 Lasserre hierarchy
Kurpisz, Adam, (2017)
-
A Hierarchy of Bounds for Stochastic Mixed-Integer Programs
Sandikci, Burhaneddin, (2009)
-
A hierarchy of relaxations for linear generalized disjunctive programming
Sawaya, Nicolas, (2012)
- More ...
-
Majumdar, Anirudha, (2020)
-
Sums of separable and quadratic polynomials
Ahmadi, Amir Ali, (2023)
-
Time-varying semidefinite programs
Ahmadi, Amir Ali, (2021)
- More ...