Saved in:
Bibliographic Details
Main Authors: Cristancho, Sergio, Velasco, Mauricio
Format: Preprint
Published: 2022
Subjects:
Online Access:https://arxiv.org/abs/2202.12865
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915694352793600
author Cristancho, Sergio
Velasco, Mauricio
author_facet Cristancho, Sergio
Velasco, Mauricio
contents We introduce novel polyhedral approximation hierarchies for the cone of nonnegative forms on the unit sphere in $\mathbb{R}^n$ 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.
format Preprint
id arxiv_https___arxiv_org_abs_2202_12865
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Harmonic Hierarchies for Polynomial Optimization
Cristancho, Sergio
Velasco, Mauricio
Optimization and Control
We introduce novel polyhedral approximation hierarchies for the cone of nonnegative forms on the unit sphere in $\mathbb{R}^n$ 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.
title Harmonic Hierarchies for Polynomial Optimization
topic Optimization and Control
url https://arxiv.org/abs/2202.12865