Numerica: A Modeling Language for Global Optimization

Part 1 Introduction: nonlinear programming local methods global methods Numerica outline. Part 2 A tour of Numerica: getting started generic constraints constants ranges input parameters aggregation operators functions sets unconstrained optimization constrained optimization local constraint solving local unconstrained optimization soft constraints real constraints and uncertain data display accuracy. Part 3 The meaning of Numerica: interval analysis constraint solving unconstrained optimization interpretation of the results. Part 4 Modelling in Numerica: what can go wrong in Numerica improving Numerica statements. Part 5 The syntax of Numerica: overall structure expressions the constant section the input section the set section the variable section the function section the body section the display section the pragma section scoping rules. Part 6 The semantics of Numerica: interval arithmetic semantics of constraint solving semantics of unconstrained minimization semantics of constrained minimization non-canonical boxes. Part 7 An implementation of Numerica: overview of the algorithm domain-specific and monotonic interval extensions constraint solving unconstrained optimization constrained optimization advanced techniques an implementation of box consistency. Part 8 Experimental results: constraint solving unconstrained optimization constrained optimization appendices.

[1]  S. Rump.  Verification methods for dense and sparse systems of equations , 1994 .

[2]  G. Nemhauser,et al.  Integer Programming , 2020 .

[3]  R. Baker Kearfott,et al.  Preconditioners for the interval Gauss-Seidel method , 1990 .

[4]  Ulrich Kulisch,et al.  Numerical Toolbox for Verified Computing I: Basic Numerical Problems Theory, Algorithms, and Pascal-Xsc Programs , 1994 .

[5]  Pascal Van Hentenryck,et al.  Helios: A Modeling Language for Global Optimization and its Implementation in Newton , 1997, Theor. Comput. Sci..

[6]  O.P.D. Cutteridge.  Powerful 2-part program for solution of nonlinear simultaneous equations , 1974 .

[7]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[8]  James Renegar,et al.  A faster PSPACE algorithm for deciding the existential theory of the reals , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[9]  David A. McAllester,et al.  Solving Polynomial Systems Using a Branch and Prune Approach , 1997 .

[10]  Eldon Hansen,et al.  Global optimization using interval analysis , 1992, Pure and applied mathematics.

[11]  Jon G. Rokne,et al.  Experiments using interval analysis for solving a circuit design problem , 1993, J. Glob. Optim..

[12]  E. Hansen,et al.  Bounding solutions of systems of equations using interval analysis , 1981 .

[13]  E. Hansen,et al.  An interval Newton method , 1983 .

[14]  R. Baker Kearfott,et al.  A Review of Techniques in the Verified Solution of Constrained Global Optimization Problems , 1996 .

[15]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[16]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[17]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[18]  Pascal Van Hentenryck,et al.  Strategic directions in constraint programming , 1996, CSUR.

[19]  Pascal Van Hentenryck,et al.  Newton - Constraint Programming over Nonlinear Constraints , 1998, Sci. Comput. Program..

[20]  A. Neumaier.  Interval methods for systems of equations , 1990 .

[21]  J. Ebers,et al.  Large-Signal Behavior of Junction Transistors , 1954, Proceedings of the IRE.

[22]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[23]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..