Optimization of Polynomials with Sparsity Encoded in a Few Linear Forms
Résumé
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.
Domaines
Optimisation et contrôle [math.OC]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|