Pages that link to "Item:Q849186"
From MaRDI portal
The following pages link to On verified numerical computations in convex programming (Q849186):
Displaying 5 items.
- Relaxed verification for continuous problems (Q1194381) (← links)
- A rigorous lower bound for the optimal value of convex optimization problems (Q1424965) (← links)
- A review of computation of mathematically rigorous bounds on optima of linear programs (Q2399497) (← links)
- Accuracy Certificates for Computational Problems with Convex Structure (Q3169082) (← links)
- Mathematically rigorous global optimization in floating-point arithmetic (Q4685569) (← links)