Interval-Based Projection Method for Under-Constrained Numerical Systems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Constraints Année : 2012

Interval-Based Projection Method for Under-Constrained Numerical Systems

Résumé

This paper presents an interval-based method that follows the branch-and-prune scheme to compute a verified paving of a projection of the solution set of an under-constrained system. Benefits of this algorithm include anytime solving process, homogeneous verification of inner boxes, and applicability to generic problems, allowing any number of (possibly nonlinear) equality and inequality constraints. We present three key improvements of the algorithm dedicated to projection problems: (i) The verification process is enhanced in order to prove faster larger boxes in the projection space. (ii) Computational effort is saved by pruning redundant portions of the solution set that would project identically. (iii) A dedicated branching strategy allows reducing the number of treated boxes. Experimental results indicate that various applications can be modeled as projection problems and can be solved efficiently by the proposed method.
Fichier principal
Vignette du fichier
igj-constraints12.pdf (1.34 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00868023 , version 1 (01-10-2013)

Identifiants

Citer

Daisuke Ishii, Alexandre Goldsztejn, Christophe Jermann. Interval-Based Projection Method for Under-Constrained Numerical Systems. Constraints, 2012, 17 (4), pp.432-460. ⟨10.1007/s10601-012-9126-y⟩. ⟨hal-00868023⟩
194 Consultations
281 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More