A gentle introduction to NUMERICA

Artificial Intelligence

Volumn 103, Issue 1-2, 1998, Pages 209-235

  Van Hentenryck, Pascal ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; NUMERICAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

GLOBAL OPTIMIZATION PROBLEM; SOFTWARE PACKAGE NUMERICA;

COMPUTER SIMULATION LANGUAGES;

EID: 0032131637     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(98)00053-8     Document Type: Article

References (40)

1. G. Alefeld, J. Herzberger, Introduction to Interval Computations, Academic Press, New York, 1983.
2. F. Benhamou, D. McAllester, P. Van Hentenryck, CLP(intervals) revisited, in: Proc. International Symposium on Logic Programming (ILPS-94), Ithaca, NY, November 1994, pp. 124-138.
3. F. Benhamou, W. Older, Applying interval arithmetic to real, integer and Boolean constraints, Journal of Logic Programming 32 (1) (1997) 1-24.
4. J. Canny, Some algebraic and geometric computations in PSPACE, in: Proc. 20th ACM Symposium on the Theory of Computing, 1988, pp. 460-467.
5. O. Caprani, K. Madsen, Mean value forms in interval analysis, Computing 25 (1980) 147-154.
6. J.G. Cleary, Logical arithmetic, Future Generation Computing Systems 2 (2) (1987) 125-149.
7. O.P.D. Cutteridge, Powerful 2-part program for solution of nonlinear simultaneous equations, Electronics Letters 10 (1971).
8. J.E. Dennis, R.B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice Hall, Englewood Cliffs, NJ, 1983.
9. J.J. Ebers, J.L. Moll, Large-scale behaviour of junction transistors, IEE Proc. 42 (1954) 1761-1772.
10. R.S. Garfinkel, G.L. Nemhauser, Integer Programming. John Wiley, New York, 1972.
11. V. Gehrke, W. Marquardt, Direct computation of all singular points of chemical engineering models using interval methods, in: International Conference on Interval Methods and Computer Aided Proofs in Science and Engineering, Würzburg, Germany, 1996.
12. 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.
13. E. Hansen, Global Optimization Using Interval Analysis, Marcel Dekker, New York, 1992.
14. E.R. Hansen, R.I. Greenberg, An interval Newton method, Appl. Math. Comput. 12 (1983) 89-98.
15. E.R. Hansen, S. Sengupta, Bounding solutions of systems of equations using interval analysis, BIT 21 (1981) 203-211.
16. E.R. Hansen, R.R. Smith, Interval arithmetic in matrix computation: part II, SIAM Journal on Numerical Analysis 4 (1967) 1-9.
17. W. Hock, K. Schittkowski, Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems, Springer, 1981.
18. H. Hong, V. Stahl, Safe starting regions by fixed points and tightening, Computing 53 (3-4) (1994) 323-335.
19. J. Moré, B. Garbow, K. Hillstrom, Testing unconstrained optimization software, ACM Transactions on Mathematical Software 7 (1) (1981) 17-41.
20. R.B. Kearfott, Preconditioners for the interval Gauss-Seidel method, SIAM Journal of Numerical Analysis 27 (1990) 804-822.
21. R.B. Kearfott, A review of preconditioners for the interval Gauss-Seidel method, Interval Computations 11 (1991) 59-85.
22. R.B. Kearfott, A review of techniques in the verified solution of constrained global optimization problems, to appear.
23. R. Krawczyk, Newton-algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken, Computing 4 (1969) 187-201.
24. O. Lhomme, Consistency techniques for numerical constraint satisfaction problems, in: Proc. 1993 International Joint Conference on Artificial Intelligence (IJCAI-93), Chambery, France, August 1993.
25. A.K. Mackworth, Consistency in networks of relations, Artificial Intelligence 8 (1) (1977) 99-118.
26. A.K. Mackworth, E.C. Freuder, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artificial Intelligence 25 (1985) 65-74.
27. U. Montanari, Networks of constraints: fundamental properties and applications to picture processing, Information Science 7 (2) (1974) 95-132.
28. R.E. Moore, Interval Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1966.
29. R.E. Moore, Methods and Applications of Interval Analysis, SIAM, Philadelphia, PA, 1979.
30. R.E. Moore, S.T. Jones, Safe starting regions for iterative methods, SIAM Journal on Numerical Analysis 14 (1977) 1051-1065.
31. A.P. Morgan, Solving Polynomial Systems Using Continuation for Scientific and Engineering Problems, Prentice-Hall, Englewood Cliffs, NJ, 1987.
32. A. Neumaier, Interval Methods for Systems of Equations, PHI Series in Computer Science, Cambridge University Press, Cambridge, 1990.
33. W. Older, A. Vellino, Constraint arithmetic on real intervals, in: Constraint Logic Programming: Selected Research, MIT Press, Cambridge, MA, 1993.
34. H. Ratschek, J. Rokne, New Computer Methods for Global Optimization, Ellis Horwood Limited, Chichester, 1988.
35. H. Ratschek, J. Rokne, Experiments using interval analysis for solving a circuit design problem, Journal of Global Optimization 3 (1993) 501-518.
36. J. Renegar, A faster PSPACE algorithm for the existential theory of the reals, in: Proc. 29th IEEE Symp. Foundations of Computer Science, 1988, pp. 291-295.
37. 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.
38. P. Van Hentenryck, D. McAllister, D. Kapur, Solving polynomial systems using a branch and prune approach, SIAM Journal on Numerical Analysis 34 (2) (1997) 797-827.
39. P. Van Hentenryck, L. Michel, Y. Deville, Numerica: a Modeling Language for Global Optimization, MIT Press, Cambridge, MA, 1997.
40. P. Van Hentenryck, V. Saraswat, Strategic directions in constraint programming, ACM Computing Surveys 28 (4) (1996).