Helios: A modeling language for global optimization and its implementation in Newton

Theoretical Computer Science

Volumn 173, Issue 1, 1997, Pages 3-48

  Michel, Laurent ^a   Van Hentenryck, Pascal ^a  

^a Brown University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; LOGIC PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; PROGRAM COMPILERS;

GLOBAL OPTIMIZATION; HELIOS; INTERVAL ANALYSIS; MODELING LANGUAGE; NEWTON; SEMANTIC PROPERTIES;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0031077511     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00190-9     Document Type: Article

References (35)

1. F. Benhamou, D. McAllester and P. Van Hentenryck, CLP (intervals) revisited, in: Proc. Internat. Symp. on Logic Programming (ILPS-94), Ithaca, NY (1994) 124-138.
2. F. Benhamou and W. Older, Applying interval arithmetic to real, integer and Boolean constraints, J. Logic Programm. (1997), to appear.
3. J. Bisschop and A. Meeraus, On the development of a general algebraic modeling system in a strategic planning environment, Math. Programm. Study 20 (1982) 1-29.
4. J.G. Cleary, Logical arithmetic, Future Generation Comput. Systems 2(2) (1987) 125-149.
5. R. Fourer, Modeling languages versus matrix generators for linear programming, ACM Trans. Math. Software 9 (1983) 143-183.
6. R. Fourer, D. Gay and B.W. Kernighan, AMPL: A Modeling Language for Mathematical Programming (The Scientific Press, San Francisco, CA, 1993).
7. R. Hammer, M. Hocks, M. Kulisch and D. Ratz, Numerical Toolbox for Verified Computing I - Basic Numerical Problems, Theory, Algorithms, and PASCAL-XSC Programs (Springer, Heidelberg, 1993).
8. E. Hansen, Global Optimization Using Interval Analysis (Marcel Dekker, New York, 1992).
9. E.R. Hansen and R.I. Greenberg, An interval Newton method, Appl. Math. Comput. 12 (1983) 89-98.
10. E.R. Hansen and S. Sengupta, Bounding solutions of systems of equations using interval analysis, BIT 21 (1981) 203-211.
11. W. Hock and K. Schittkowski, Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems (Springer, Berlin, 1981).
12. H. Hong and V. Stahl, Safe starting regions by fixed points and tightening, Computing 53 (1994) 323-335.
13. R. Horst and P.M. Pardalos, Handbook of Global Optimization (Kluwer Academic Publishers, Dordrecht, 1995).
14. R.B. Kearfott, Preconditioners for the interval Gauss-Seidel method, SIAM J. Numer. Anal 27 (1990).
15. R.B. Kearfott, A review of preconditioners for the interval Gauss-Seidel method, Interval Comput. 1 (1991) 59-85.
16. R.B. Kearfott, A review of techniques in the verified solution of constrained global optimization problems, to appear, 1994.
17. R. Krawczyk, Newton-algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken, Computing 4 (1969) 187-201.
18. A.V. Levy and A. Montalvo, The tunnelling algorithm for the global minimization of functions, SIAM J. Sci. Statist. Comput. 6 (1985) 15-29.
19. A.K. Mackworth, Consistency in networks of relations, Artificial Intelligence 8 (1977) 99-118.
20. K. Meintjes and A.P. Morgan, Chemical equilibrium systems as numerical test problems, ACM Trans. Math. Software 16 (1990) 143-151.
21. U. Montanari, Networks of constraints: fundamental properties and applications to picture processing, Inform. Sci. 7(2) (1974) 95-132.
22. R.E. Moore, Interval Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1966).
23. R.E. Moore and S.T. Jones, Safe starting regions for iterative methods, SIAM J. Numer. Anal. 14 (1977) 1051-1065.
24. J.J. More and M.Y. Cosnard, Numerical solution of nonlinear equations. ACM Trans. Math. Software 5 (1979) 64-85.
25. J. More, B. Garbow and K. Hillstrom, Testing unconstrained optimization software, ACM Trans. Math. Software 7(1) (1981) 17-41.
26. A.P. Morgan, Computing all solutions to polynomial systems using homotopy continuation, Appl. Math. Comput. 24 (1987) 115-138.
27. A.P. Morgan, Solving Polynomial System Using Continuation for Scientific and Engineering Problems (Prentice-Hall, Englewood Cliffs, NJ, 1987).
28. A. Neumaier, Interval Methods for Systems of Equations, PHI Series in Computer Science (Cambridge Univ. Press, Cambridge, 1990).
29. W. Older and A. Vellino, Extending prolog with constraint arithmetics on real intervals, in: Canadian Conf. on Computer & Electrical Engineering, Ottawa, 1990.
30. D. Ratz, Box-splitting strategies for the interval Gauss-Seidel step in a global optimization method, Computing 53 (1994) 337-353.
31. S.M. Rump, Verification methods for dense and sparse systems of equations, in: J. Herzberger, ed., Topics in Validated Computations (Elsevier, Amsterdam, 1988) 217-231.
32. H. Schwefel, Numerical Optimization of Computer Models (Wiley, New York, 1981).
33. P. Van Hentenryck, D. McAllister and D. Kapur, Solving polynomial systems using a branch and prune approach, SIAM J. Numer. Anal. 34 (1997) to appear.
34. P. Van Hentenryck, L. Michel and F. Benhamou, Newton: constraint programming over nonlinear constraints, Sci. Comput. Programm. 1997, to appear.
35. J. Verschelde, P. Verlinden and R. Cools, Homotopies exploiting newton polytopes for solving sparse polynomial systems, SIAM J. Numer. Anal. 31 (1994) 915-930.