Interval-based projection method for under-constrained numerical systems

Daisuke Ishii, Alexandre Goldsztejn, Christophe Jermann

    研究成果: Article

    19 引用 (Scopus)

    抜粋

    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.

    元の言語English
    ページ(範囲)432-440
    ページ数9
    ジャーナルConstraints
    17
    発行部数4
    DOI
    出版物ステータスPublished - 2012 10

    ASJC Scopus subject areas

    • Artificial Intelligence
    • Computational Theory and Mathematics
    • Software
    • Discrete Mathematics and Combinatorics

    フィンガープリント Interval-based projection method for under-constrained numerical systems' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用