Validated constraints solving --- practicalities, pitfalls, and new developments

DOI10.1007/S11155-005-0045-0MaRDI QIDQ2568645zbMATH OpenOpenAlexFDO

Authors Ralph Baker Kearfott

Publication date 18 October 2005

Published in Reliable Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11155-005-0045-0

zbMATH Keywords

robustnesslinear relaxationsgeometric computationslarge, sparse linear program

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)

Recommendations

• Validated Linear Relaxations and Preprocessing: Some Experiments
• Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
• Constraint propagation on quadratic constraints
• Tolerances in geometric constraint problems
• scientific article; zbMATH DE number 558488

Cites work

• scientific article; zbMATH DE number 804603 (Why is no real title available?)
• A rigorous lower bound for the optimal value of convex optimization problems
• Computational complexity and feasibility of data processing and interval computations
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems
• Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
• Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
• Global Optimization and Constraint Satisfaction
• Interval Methods for Systems of Equations
• Numerical Software with Result Verification
• Rigorous global search: continuous problems
• Safe bounds in linear and mixed-integer linear programming
• Symbolic preconditioning with Taylor models: Some examples

Cited in

(2)

• The DeltaUp constraint solver: Minimizing the number of method selections in DeltaBlue
• Tolerances in geometric constraint problems

Describes a project that uses

Uses Software

• Numerica
• Cosy
• GlobSol
• INTOPT_90

This page was built for publication: Validated constraints solving --- practicalities, pitfalls, and new developments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568645)