Set approximation via minimum-volume polynomial sublevel sets - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Set approximation via minimum-volume polynomial sublevel sets

Résumé

Motivated by problems of uncertainty propagation and robust estimation we are interested in computing a polynomial sublevel set of fixed degree and minimum volume that contains a given semialgebraic set K. At this level of generality this problem is not tractable, even though it becomes convex e.g. when restricted to nonnegative homogeneous polynomials. Our contribution is to describe and justify a tractable L^1-norm or trace heuristic for this problem, relying upon hierarchies of linear matrix inequality (LMI) relaxations when K is semialgebraic, and simplifying to linear programming (LP) when K is a collection of samples, a discrete union of points.
Fichier principal
Vignette du fichier
minvol.pdf (703.1 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00740794 , version 1 (11-10-2012)

Identifiants

Citer

Fabrizio Dabbene, Didier Henrion. Set approximation via minimum-volume polynomial sublevel sets. European Control Conference (ECC), Jul 2013, Zurich, Switzerland. 11p. ⟨hal-00740794⟩
134 Consultations
529 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More