Pages that link to "Item:Q3133585"

The following pages link to Certified Roundoff Error Bounds Using Semidefinite Programming (Q3133585):

Displaying 14 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)
• 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)
• A unified framework of SAGE and SONC polynomials and its duality theory (Q5856744) (← links)
• The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices (Q6113351) (← links)