Newton: Constraint programming over nonlinear constraints

Science of Computer Programming

Volumn 30, Issue 1-2, 1998, Pages 83-118

  Van Hentenryck, Pascal ^a   Michel, Laurent ^a   Benhamou, Frédéric ^b  

^a BROWN UNIVERSITY   (United States)

^b UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

Constraint programming; Interval reasoning; Nonlinear programming

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; LOGIC PROGRAMMING; NONLINEAR PROGRAMMING; NUMERICAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

INTERVAL NEWTON METHOD; NEWTON PROGRAMMING LANGUAGE;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0031619233     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6423(97)00008-7     Document Type: Article

References (37)

1. F. Benhamou, D. McAllester, P. Van Hentenryck, CLP(intervals) revisited, in: Proc. Internat. Symp. on Logic Programming (ILPS-94), Ithaca, NY, November 1994, pp. 124-138.
2. F. Benhamou, W. Older, Applying interval arithmetic to real, integer and Boolean constraints, J. Logic Programming, 1997, to appear.
3. J.G. Cleary, Logical arithmetic, Future Generation Comput. Systems 2 (1987) 125-149.
4. R. Hammer, M. Hocks, M. Kulisch, D. Ratz, Numerical Toolbox for Verified Computing I - Basic Numerical Problems, Theory, Algorithms, and PASCAL-XSC Programs, Springer, Heidelberg, 1993.
5. E. Hansen, Global Optimization Using Interval Analysis, Marcel Dekker, New York, 1992.
6. E.R. Hansen, R.I. Greenberg, An interval Newton method, Appl. Math. Comput. 12 (1983) 89-98.
7. E.R. Hansen, S. Sengupta, Bounding solutions of systems of equations using interval analysis, BIT 21 (1981) 203-211.
8. W. Hock, K. Schittkowski, Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, 1981.
9. H. Hong, V. Stahl, Safe starting regions by fixed points and tightening, Computing 53 (3-4) (1994) 323-335.
10. J. Moré, B. Garbow, K. Hillstrom, Testing unconstrained optimization software, ACM Trans. Math. Software 7 (1) (1981) 17-41.
11. R.B. Kearfott, Preconditioners for the interval Gauss-Seidel Method, SIAM J. Numer. Anal. 27 (1990).
12. R.B. Kearfott, A review of preconditioners for the interval Gauss-Seidel method, Interval Comput. 1 1 (1991) 59-85.
13. R.B. Kearfott, A review of techniques in the verified solution of constrained global optimization problems, to appear.
14. R. Krawczyk, Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken, Computing 4 (1969) 187-201.
15. J.H.M. Lee, M.H. van Emden, Interval computation as deduction in CHIP, J. Logic Programming 16 (3-4) (1993) 255-276.
16. A.V. Levy, A. Montalvo, The tunnelling algorithm for the global minimization of functions, SIAM J. Sci. Statist. Comput. 6 (1) (1985) 15-29.
17. A.K. Mackworth, Consistency in networks of relations, Artificial Intelligence 8 (1) (1977) 99-118.
18. K. Meintjes, A.P. Morgan, Chemical equilibrium systems as numerical test problems, ACM Trans. Math. Software 16 (1990) 143-151.
19. U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Inform. Sci. 7 (2) (1974) 95-132.
20. R.E. Moore, Interval Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1966.
21. R.E. Moore, Methods and Applications of Interval Analysis, SIAM, Philadelphia, 1979.
22. R.E. Moore, S.T. Jones, Safe starting regions for iterative methods, SIAM J. Numer. Anal. 14 (1977) 1051-1065.
23. J.J. More, M.Y. Cosnard, Numerical solution of nonlinear equations, ACM Trans. Math. Software 5 (1979) 64-85.
24. A.P. Morgan, Computing all solutions to polynomial systems using homotopy continuation, Appl. Math. Comput. 24 (1987) 115-138.
25. A.P. Morgan, Solving Polynomial Systems Using Continuation for Scientific and Engineering Problems, Prentice-Hall, Englewood Cliffs, NJ, 1987.
26. A. Neumaier, Interval Methods for Systems of Equations, PHI Series in Computer Science, Cambridge University Press, Cambridge, 1990.
27. W. Older, F. Benhamou, Programming in CLP(BNR), PPCP'93, Newport, RI (USA), 1993.
28. W. Older, A. Vellino, Extending prolog with constraint arithmetics on real intervals, in: Canadian Conf. on Computer & Electrical Engineering, Ottawa, 1990.
29. W. Older, A. Vellino, Constraint arithmetic on real intervals, in: Constraint Logic Programming: Selected Research, The MIT Press, Cambridge, MA, 1993.
30. L.B. Rall, Automatic Differentiation: Techniques and Applications, Lectures Notes in Computer Science, Springer, New York, 1981.
31. H. Ratschek, J. Rokne, New Computer Methods for Global Optimization, Ellis Horwood Limited, Chichester, 1988.
32. D. Ratz, Box-splitting strategies for the interval Gauss-Seidel step in a global optimization method, Computing 53 (3-4) (1994) 337-353.
33. S.M. Rump, Verification methods for dense and sparse systems of equations, in: J. Herzberger (Ed.), Topics in Validated Computations, Elsevier, Amsterdam, 1988, pp. 217-231.
34. H. Schwefel, Numerical Optimization of Computer Models, Wiley, New York, 1981.
35. G. Sidebottom, W. Havens, Hierarchical arc consistency applied to numeric processing in constraint logic programming, Computat. Intelligence 8 (4) (1992).
36. P. Van Hentenryck, D. McAllister, D. Kapur, Solving polynomial systems using a branch and prune approach, SIAM J. Numer. Anal. 34 (2) (1997).
37. J. Verschelde, P. Verlinden, R. Cools, Homotopies exploiting Newton polytopes for solving sparse polynomial systems, SIAM J. Numer. Anal. 31 (3) (1994) 915-930.