Skip to Main content Skip to Navigation
Journal articles

Interval-Based Projection Method for Under-Constrained Numerical Systems

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Christophe Jermann <>
Submitted on : Tuesday, October 1, 2013 - 11:31:04 AM
Last modification on : Wednesday, January 6, 2021 - 10:28:02 PM
Long-term archiving on: : Friday, April 7, 2017 - 4:34:27 AM


Files produced by the author(s)


  • HAL Id : hal-00868023, version 1



Daisuke Ishii, Alexandre Goldsztejn, Christophe Jermann. Interval-Based Projection Method for Under-Constrained Numerical Systems. Constraints, Springer Verlag, 2012, 17 (4), pp.432-460. ⟨hal-00868023⟩



Record views


Files downloads