Optimization of Polynomials with Sparsity Encoded in a Few Linear Forms - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

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.
Fichier principal
Vignette du fichier
few-lin.pdf (132.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03628891 , version 1 (03-04-2022)

Identifiants

Citer

Jean-Bernard Lasserre. Optimization of Polynomials with Sparsity Encoded in a Few Linear Forms. 25th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2022), Sep 2022, Beyreuth, Germany. pp.383-387. ⟨hal-03628891⟩
26 Consultations
10 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More