Certified Roundoff Error Bounds Using Semidefinite Programming
From MaRDI portal
Publication:3133585
DOI10.1145/3015465zbMath1380.65084arXiv1507.03331OpenAlexW2227234579WikidataQ113310145 ScholiaQ113310145MaRDI QIDQ3133585
No author found.
Publication date: 5 February 2018
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.03331
semidefinite programmingformal verificationroundoff errortranscendental functionsfloating-point arithmeticproof assistantpolynomial optimizationcorrelation sparsity pattern
Related Items
Rigorous roundoff error analysis of probabilistic floating-point computations, Sparse noncommutative polynomial optimization, SONC optimization and exact nonnegativity certificates via second-order cone programming, Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares, The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices, Exploiting term sparsity in noncommutative polynomial optimization, A two-phase approach for conditional floating-point verification, TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity, Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension, Deductive verification of floating-point Java programs in KeY, Runtime abstract interpretation for numerical accuracy and robustness, Combining tools for optimization and analysis of floating-point computations, A sublevel moment-SOS hierarchy for polynomial optimization, Exploiting sparsity in complex polynomial optimization, A unified framework of SAGE and SONC polynomials and its duality theory
Uses Software
