Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere

We study the convergence rate of a hierarchy of upper bounds for polynomial minimization problems, proposed by Lasserre (SIAM J Optim 21(3):864–885, 2011), for the special case when the feasible set is the unit (hyper)sphere. The upper bound at level r ∈ N of the hierarchy is defined as the minimal...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming Ročník 193; číslo 2; s. 665 - 685
Hlavní autori:	de Klerk, Etienne, Laurent, Monique
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2022 Springer Springer Nature B.V
Predmet:	Analysis Calculus of Variations and Optimal Control; Optimization Combinatorics Convergence Distribution (Probability theory) Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Polynomials Probability density functions Theoretical Upper bounds Generalized eigenvalue problem Semidefinite programming 90C30 Polynomial optimization on sphere 90C22 Lasserre hierarchy 90C26
ISSN:	0025-5610, 1436-4646
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!