A bounded degree SOS hierarchy for polynomial optimization
Year of publication: |
March 2017
|
---|---|
Authors: | Lasserre, Jean-Bernard ; Toh, Kim-Chuan ; Yang, Shouguang |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 5.2017, 1/2, p. 87-117
|
Subject: | Global optimization | Polynomial optimization convex relaxations | LP and semidefinite hierarchies | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Mathematik | Mathematics |
-
Inverse polynomial optimization
Lasserre, Jean-Bernard, (2013)
-
Mathematical programming techniques in water network optimization
D'Ambrosio, Claudia, (2015)
-
A dual reformulation and solution framework for regularized convex clustering problems
Pi, J., (2021)
- More ...
-
A probabilistic model for minmax regret in combinatorial optimization
Natarajan, Karthik, (2014)
-
Vaccine Appointment Scheduling : The Second Dose Challenge
Bandi, Chaitanya, (2021)
-
A new homotopy proximal variable-metric framework for composite convex minimization
Quoc, Tran-Dinh, (2022)
- More ...