Optimization of Polynomials with Sparsity Encoded in a Few Linear Forms
Optimization and Control
2022-04-05 v1
Abstract
We consider polynomials of a few linear forms and show how exploit this type of sparsity for optimization on some particular domains like the Euclidean sphere or a polytope. Moreover, a simple procedure allows to detect this form of sparsity and also allows to provide an approximation of any polynomial by such sparse polynomials.
Cite
@article{arxiv.2204.01319,
title = {Optimization of Polynomials with Sparsity Encoded in a Few Linear Forms},
author = {Jean-Bernard Lasserre},
journal= {arXiv preprint arXiv:2204.01319},
year = {2022}
}