Uniform sample generation in semialgebraic 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 : 2014

Uniform sample generation in semialgebraic sets

Résumé

We propose efficient techniques for generating independent identically distributed uniform random samples inside semialgebraic sets. The proposed algorithm leverages recent results on the approximation of indicator functions by polynomials %\cite{DabHen:13} to develop acceptance/rejection based sample generation algorithms with guaranteed performance in terms of rejection rate (the number of samples that should be generated in order to obtain an accepted sample). Moreover, the {acceptance} rate is shown to be is asymptotically optimal, in the sense that it tends to one (all samples accepted) as the degree of the polynomial approximation increases. The performance of the proposed method is illustrated by a numerical example.
Fichier principal
Vignette du fichier
sampling.pdf (751.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00961074 , version 1 (19-03-2014)

Identifiants

Citer

Fabrizio Dabbene, Didier Henrion, Constantino Lagoa. Uniform sample generation in semialgebraic sets. IEEE Conference on Decision and Control ( CDC ), Dec 2014, Los Angeles, United States. pp. 5177-5182. ⟨hal-00961074⟩
243 Consultations
108 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More