Computational experience with rigorous error bounds for the Netlib linear programming library

DOI10.1007/s11155-006-9004-7zbMath1099.65051OpenAlexW1987418085MaRDI QIDQ2503174

Christian Jansson, Christian Keil

Publication date: 14 September 2006

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11155-006-9004-7

zbMATH Keywords

performancealgorithmsnumerical examplesinterval arithmeticverification methodill-posedness problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interval and finite arithmetic (65G30) Complexity and performance of numerical algorithms (65Y20) Algorithms with automatic result verification (65G20)

Related Items

A stable primal-dual approach for linear programming under nondegeneracy assumptions ⋮ On verified numerical computations in convex programming ⋮ Best practices for comparing optimization algorithms ⋮ Certifying feasibility and objective value of linear programs ⋮ Computational experience with rigorous error bounds for the Netlib linear programming library

Uses Software

• PROFIL/BIAS
• lp_solve
• Netlib
• INTOPT_90
• NETLIB LP Test Set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rigorous global search: continuous problems
• A rigorous lower bound for the optimal value of convex optimization problems
• Safe bounds in linear and mixed-integer linear programming
• Computational experience with rigorous error bounds for the Netlib linear programming library
• Interval Methods for Systems of Equations
• Introduction to Numerical Analysis
• Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
• Rigorous Lower and Upper Bounds in Linear Programming
• Complete search in continuous global optimization and constraint satisfaction
• Global Optimization and Constraint Satisfaction