HARMONIC HIERARCHIES FOR POLYNOMIAL OPTIMIZATION

Sergio Cristancho, Mauricio Velasco

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)590-615
Number of pages26
JournalSIAM Journal on Optimization
Volume34
Issue number1
DOIs
StatePublished - 2024
Externally publishedYes

Keywords

  • linear hierarchies
  • polynomial kernels
  • polynomial optimization
  • semidefinite hierarchies

Fingerprint

Dive into the research topics of 'HARMONIC HIERARCHIES FOR POLYNOMIAL OPTIMIZATION'. Together they form a unique fingerprint.

Cite this