Pages that link to "Item:Q2503174"
From MaRDI portal
The following pages link to Computational experience with rigorous error bounds for the Netlib linear programming library (Q2503174):
Displaying 7 items.
- Certifying feasibility and objective value of linear programs (Q453056) (← links)
- A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- The final NETLIB-LP results (Q1417592) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- A review of computation of mathematically rigorous bounds on optima of linear programs (Q2399497) (← links)
- Computational experience with rigorous error bounds for the Netlib linear programming library (Q2503174) (← links)