Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming
From MaRDI portal
Publication:4611311
DOI10.1145/3206430zbMath1484.65126arXiv1611.01318OpenAlexW2750751278WikidataQ113310078 ScholiaQ113310078MaRDI QIDQ4611311
Publication date: 18 January 2019
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.01318
semidefinite programminggeneralized eigenvaluesrobust optimizationroundoff errorfloating-point arithmeticpolynomial optimization
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) General methods in interval analysis (65G40)
Related Items (8)
Sparse noncommutative polynomial optimization ⋮ Exploiting term sparsity in noncommutative polynomial optimization ⋮ TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity ⋮ Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension ⋮ Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures ⋮ Enclosing Chebyshev Expansions in Linear Time ⋮ A sublevel moment-SOS hierarchy for polynomial optimization ⋮ Exploiting sparsity in complex polynomial optimization
Uses Software
This page was built for publication: Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming