by P. Van Hentenryck, D. Mcallester, D. Kapur
SIAM Journal on Numerical Analysis
ftp://ftp.cs.unh.edu/pub/csp/archive/papers/hentenryck-mcallester-kapur.ps.gz
Add To MetaCart
Abstract:
This paper presents Newton, a branch & prune algorithm to find all isolated solutions of a system of polynomial constraints. Newton can be characterized as a global search method which uses intervals for numerical correctness and for pruning the search space early. The pruning in Newton consists in enforcing at each node of the search tree a unique local consistency condition, called boxconsistency, which approximates the notion of arc-consistency well-known in artificial intelligence. Box-consistency is parametrized by an interval extension of the constraint and can be instantiated to produce Hansen-Segupta narrowing operator (used in interval methods) as well as new operators which are more effective when the computation is far from a solution. Newton has been evaluated on a variety of benchmarks from kinematics, chemistry, combustion, economics, and mechanics. On these benchmarks, it outperforms the interval methods we are aware of and compares well with state-of-the-art continuation methods. Limitations of Newton (e.g. a sensitivity to the size of the initial intervals on some problems) are also discussed. Of particular interest is the mathematical and programming simplicity of the method.
Citations
|
877
|
Consistency in networks of relations
– Mackworth
- 1977
|
|
544
|
Interval Analysis
– Moore
- 1966
|
|
354
|
Networks of constraints: Fundamental properties and applications to picture processing
– Montanari
- 1974
|
|
347
|
Global Optimization Using Interval Analysis
– HANSEN, WALSTER
- 2004
|
|
335
|
Methods and Applications of Interval Analysis
– Moore
- 1979
|
|
319
|
Interval Methods for Systems of Equations
– Neumaier
- 1990
|
|
317
|
Introduction to Interval Computations
– ALEFELD, HERZBERGER
- 1983
|
|
156
|
Applying Interval Arithmetic to Real, Integer and Boolean Constraints
– Benhamou, Older
- 1997
|
|
137
|
Y.: Design, implementation and evaluation of the constraint languagecc(FD
– Hentenryck, Saraswat, et al.
- 1998
|
|
126
|
New Computer Methods for Global Optimization
– Ratschek, Rokne
- 1988
|
|
106
|
Hentenryck. CLP(Intervals) revisited
– Benhamou, McAllister, et al.
- 1994
|
|
106
|
Automatic Differentiation: Techniques and Applications, Lecture Notes in Computer AD Vertex Ordering Algorithms 11
– Rall
- 1981
|
|
73
|
Homotopies exploiting Newton polytopes for solving sparse polynomial systems
– Verschelde, Verlinden, et al.
- 1991
|
|
50
|
Extending Prolog with constraint arithmetic on real intervals
– Older, Vellino
- 1990
|
|
49
|
Verification Methods for Dense and Sparse Systems of Equations
– Rump
- 1994
|
|
47
|
Bounding solutions of systems of equations using interval Analysis
– Hansen, Sengupta
- 1981
|
|
45
|
Numerical Toolbox for Verified Computing I
– Hammer, Hocks, et al.
- 1993
|
|
41
|
Preconditioners for the Interval Gauss-Seidel Method
– Kearfott
- 1990
|
|
39
|
Nondeterministic lisp as a substrate for constraint logic programming
– Siskind, McAllester
- 1993
|
|
33
|
Global optimization using interval analysis { the multidimensional case
– Hansen
- 1980
|
|
33
|
Safe Starting Regions by Fixed Points and Tightening
– Hong, Stahl
- 1994
|
|
33
|
Newton-Algorithmen zur Bestimmung yon Nullstellen mit Fehlerschranken
– Krawczyk
- 1969
|
|
30
|
Solving Polynomial Systems Using Continuation for Scientific and Engineering Problems
– Morgan
- 1987
|
|
28
|
An interval Newton method
– Hansen, Greenberg
- 1983
|
|
26
|
Computing All Solutions To Polynomial Systems Using Homotopy Continuation
– Morgan
- 1987
|
|
21
|
Numerical Toolbox for Veri Computing I
– Hammer, Hocks, et al.
- 1993
|
|
20
|
Safe Starting Regions for Iterative Methods
– Moore, Jones
- 1977
|
|
20
|
Interval arithmetic in matrix computations
– Hansen, Smith
- 1967
|
|
16
|
Numerical Solution of Nonlinear Equations
– More, Cosnard
- 1979
|
|
15
|
M.: A More Complete Interval Arithmetic. Lecture Notes for a Summer Course at the
– Kahan
- 1968
|
|
15
|
Automatic Di erentiation: Techniques and Applications
– Rall
- 1981
|
|
12
|
Chemical Equilibrium Systems as Numerical test Problems
– Meintjes, Morgan
- 1990
|
|
12
|
A logic language for combinatorial optimization
– Hentenryck
- 1989
|
|
7
|
Interval arithmetic as a closed arithmetic system on a computer
– Hanson
- 1968
|
|
3
|
A Class of interval Newton
– Krawczyk
- 1986
|
|
1
|
Interval methods for systems of equations, Prentice–Hall Internat
– NEUMAIER
- 1990
|
|
1
|
Interval Methods Revisited
– HENTENRYCK, MCALLESTER, et al.
- 1995
|
