A gentle introduction to Numerica

DOI10.1016/S0004-3702(98)00053-8zbMath0910.68095MaRDI QIDQ1274762

Pascal Van Hentenryck

Publication date: 12 January 1999

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

global optimization problemsnumerica

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (3)

Constraint propagation on quadratic constraints ⋮ Numerica ⋮ Local consistency for extended CSPs

Uses Software

• minpack
• PASCAL-XSC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An interval Newton method
• Interval iteration for zeros of systems of equations
• Mean value forms in interval analysis
• Bounding solutions of systems of equations using interval analysis
• Consistency in networks of relations
• Test example for nonlinear programming codes
• Experiments using interval analysis for solving a circuit design problem
• Safe starting regions by fixed points and tightening
• 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
• Testing Unconstrained Optimization Software
• Safe Starting Regions for Iterative Methods
• Solving Polynomial Systems Using a Branch and Prune Approach
• Applying interval arithmetic to real, integer, and boolean constraints
• Interval Arithmetic in Matrix Computations, Part II

This page was built for publication: A gentle introduction to Numerica