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 | Mathematische Optimierung | Mathematical programming | Theorie | Theory | 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 ...
-
An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
Sun, Jie, (2002)
-
Peng, Jiming, (2015)
-
Vaccine Appointment Scheduling : The Second Dose Challenge
Bandi, Chaitanya, (2021)
- More ...