Pages that link to "Item:Q3133585"
From MaRDI portal
The following pages link to Certified Roundoff Error Bounds Using Semidefinite Programming (Q3133585):
Displaying 25 items.
- Rigorous roundoff error analysis of probabilistic floating-point computations (Q832297) (← links)
- Combining tools for optimization and analysis of floating-point computations (Q2024356) (← links)
- A sublevel moment-SOS hierarchy for polynomial optimization (Q2070330) (← links)
- Exploiting sparsity in complex polynomial optimization (Q2073057) (← links)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
- A two-phase approach for conditional floating-point verification (Q2233493) (← links)
- Deductive verification of floating-point Java programs in KeY (Q2233510) (← links)
- Runtime abstract interpretation for numerical accuracy and robustness (Q2234076) (← links)
- SONC optimization and exact nonnegativity certificates via second-order cone programming (Q2674014) (← links)
- Certification of bounds on expressions involving rounded operators (Q2989081) (← links)
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming (Q3614175) (← links)
- Optimal bounds for round-off errors in the cyclic peaceman-rachford iteration (Q3989777) (← links)
- Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming (Q4611311) (← links)
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity (Q5148403) (← links)
- Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension (Q5148406) (← links)
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates (Q5358295) (← links)
- The RPR2 rounding technique for semidefinite programs (Q5483509) (← links)
- A unified framework of SAGE and SONC polynomials and its duality theory (Q5856744) (← links)
- Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares (Q6081964) (← links)
- The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices (Q6113351) (← links)
- Formally verified roundoff errors using SMT-based certificates and subdivisions (Q6535941) (← links)
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization (Q6599983) (← links)
- Algorithm 1029: encapsulated error, a direct approach to evaluate floating-point accuracy (Q6599992) (← links)
- A real moment-HSOS hierarchy for complex polynomial optimization with real coefficients (Q6667691) (← links)
