HARMONIC HIERARCHIES FOR POLYNOMIAL OPTIMIZATION

Sergio Cristancho, Mauricio Velasco

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

Resumen

We introduce novel polyhedral approximation hierarchies for the cone of nonnegative forms on the unit sphere in \BbbRn and for its (dual) cone of moments. We prove computable quantitative bounds on the speed of convergence of such hierarchies. We also introduce a novel optimization-free algorithm for building converging sequences of lower bounds for polynomial minimization problems on spheres. Finally, some computational results are discussed, showcasing our implementation of these hierarchies in the programming language Julia.

Idioma originalInglés
Páginas (desde-hasta)590-615
Número de páginas26
PublicaciónSIAM Journal on Optimization
Volumen34
N.º1
DOI
EstadoPublicada - 2024
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'HARMONIC HIERARCHIES FOR POLYNOMIAL OPTIMIZATION'. En conjunto forman una huella única.

Citar esto