A bounded degree SOS hierarchy for polynomial optimization

We consider a new hierarchy of semidefinite relaxations for the general polynomial optimization problem (P):f∗=min{f(x):x∈K} on a compact basic semi-algebraic set K⊂Rn. This hierarchy combines some advantages of the standard LP-relaxations associated with Krivine’s positivity certificate and some ad...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	EURO journal on computational optimization Ročník 5; číslo 1-2; s. 87 - 117
Hlavní autoři:	Lasserre, JeanB, Toh, Kim-Chuan, Yang, Shouguang
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Elsevier Ltd 01.03.2017 Springer Berlin Heidelberg Springer Nature B.V Springer Elsevier
Témata:	90C22 90C26 Analysis Business and Management Computer programming Convergence convex relaxations Global optimization Hierarchies LP and semidefinite hierarchies Management Science Mathematical analysis Mathematics Matrices (mathematics) Matrix methods Operations Management Operations Research Operations Research/Decision Theory Optimization Optimization and Control Optimization techniques Original Paper Polynomial optimization Polynomials Software Studies Variables Global optimization 90C26 Polynomial optimization LP and semidefinite hierarchies 90C22 convex relaxations Polynomial Optimization LP-hierarchies Semidefinite hierarchies
ISSN:	2192-4406, 2192-4414
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!