Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials
SIAM Journal on Optimization · 30.09.2023 · 33 (3) · 2137-2159
DOI: 10.1137/22m1540818 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Optimization, online erschienen am 11.08.2023. Verfasst von Francis Bach und 1 weiteren Autor:innen. Die Arbeit wurde bisher 22-mal zitiert (Crossref) und nennt 34 Literaturangaben. Gefördert von: Agence Nationale de la Recherche, European Research Council.
Abstract (Originalsprache)
We consider the unconstrained optimization of multivariate trigonometric polynomials by the sum-of-squares hierarchy of lower bounds. We first show a convergence rate of [Formula: see text] for the relaxation with degree [Formula: see text] without any assumption on the trigonometric polynomial to minimize. Second, when the polynomial has a finite number of global minimizers with invertible Hessians at these minimizers, we show an exponential convergence rate with explicit constants. Our results also apply to minimizing regular multivariate polynomials on the hypercube.
Förderung
- Agence Nationale de la Recherche
- European Research Council
Zitieren
APA
Bach, F., & Rudi, A. (2023). Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials. SIAM Journal on Optimization, 33(3), 2137-2159. https://doi.org/10.1137/22m1540818
Vancouver
Bach F, Rudi A. Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials. SIAM Journal on Optimization. 2023;33(3):2137-2159. doi:10.1137/22m1540818
BibTeX
@article{Bach2023,
author = {Bach, Francis and Rudi, Alessandro},
title = {Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials},
journal = {SIAM Journal on Optimization},
year = {2023},
volume = {33},
number = {3},
pages = {2137--2159},
doi = {10.1137/22m1540818}
}
EUVIMED