\textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}
From MaRDI portal
Publication:1391927
DOI10.1016/S0304-3975(96)00190-9zbMath0905.65070OpenAlexW2087271257MaRDI QIDQ1391927
Pascal Van Hentenryck, Laurent Michel
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00190-9
global optimizationnumerical examplesinterval analysismodeling languageNewtonlogic programming languageHelios
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30) Logic programming (68N17) Complexity and performance of numerical algorithms (65Y20)
Related Items
Algorithmic differentiation techniques for global optimization in the COCONUT environment, Bound constrained interval global optimization in the COCONUT environment, Enhancing numerical constraint propagation using multiple inclusion representations, Interval propagation and search on directed acyclic graphs for numerical constraint solving, Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
Uses Software
Cites Work
- An interval Newton method
- Interval iteration for zeros of systems of equations
- Computing all solutions to polynomial systems using homotopy continuation
- Bounding solutions of systems of equations using interval analysis
- Consistency in networks of relations
- Test example for nonlinear programming codes
- Safe starting regions by fixed points and tightening
- Box-splitting strategies for the interval Gauss-Seidel step in a global optimization method
- Handbook of global optimization
- Networks of constraints: Fundamental properties and applications to picture processing
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Preconditioners for the Interval Gauss–Seidel Method
- The Tunneling Algorithm for the Global Minimization of Functions
- Testing Unconstrained Optimization Software
- Safe Starting Regions for Iterative Methods
- Numerical Solution of Nonlinear Equations
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Solving Polynomial Systems Using a Branch and Prune Approach
- Applying interval arithmetic to real, integer, and boolean constraints
- Chemical equilibrium systems as numerical test problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
