Optimization-Aided Construction of Multivariate Chebyshev Polynomials
<|reference_start|>Optimization-Aided Construction of Multivariate Chebyshev Polynomials: This article is concerned with an extension of univariate Chebyshev polynomials of the first kind to the multivariate setting, where one chases best approximants to specific monomials by polynomials of lower degree relative to the uniform norm. Exploiting the Moment-SOS hierarchy, we devise a versatile semidefinite-programming-based procedure to compute such best approximants, as well as associated signatures. Applying this procedure in three variables leads to the values of best approximation errors for all mononials up to degree six on the euclidean ball, the simplex, and the cross-polytope. Furthermore, inspired by numerical experiments, we obtain explicit expressions for Chebyshev polynomials in two cases unresolved before, namely for the monomial $x_1^2 x_2^2 x_3$ on the euclidean ball and for the monomial $x_1^2 x_2 x_3$ on the simplex.<|reference_end|>
@article{dressler2024optimization-aided,
    title={Optimization-Aided Construction of Multivariate Chebyshev Polynomials},
    author={Mareike Dressler, Simon Foucart, Mioara Joldes, Etienne de Klerk, Jean
  Bernard Lasserre, Yuan Xu},
    journal={arXiv preprint arXiv:2405.10438},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.10438},
    primaryClass={math.OC cs.NA math.NA}
}