Pages that link to "Item:Q1424965"
From MaRDI portal
The following pages link to A rigorous lower bound for the optimal value of convex optimization problems (Q1424965):
Displaying 6 items.
- On verified numerical computations in convex programming (Q849186) (← links)
- Safe and tight linear estimators for global optimization (Q1774166) (← links)
- Contracting optimally an interval matrix without loosing any positive semi-definite matrix is a tractable problem (Q2484023) (← links)
- Computational experience with rigorous error bounds for the Netlib linear programming library (Q2503174) (← links)
- Validated constraints solving --- practicalities, pitfalls, and new developments (Q2568645) (← links)
- Mathematically rigorous global optimization in floating-point arithmetic (Q4685569) (← links)
