Minimum Ellipsoid Bounds for Solutions of Polynomial Systems via Sum of Squares

2004/11/05 by Jiawang Nie, Nie, Jiawang, James Demmel +1 · 2 citations
Computer Science · Mathematics · #Advanced Differential Equations and Dynamical Systems #Advanced Optimization Algorithms Research #FOS: Mathematics #Optimization and Control (math.OC) #Polynomial and algebraic computation

paper · pdf · doi:10.48550/arxiv.math/0411122

openalex publication_date 2004/11/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper has been withdrawn by the authors due to its publication

Citations

• Semidefinite programming relaxations for semialgebraic problems

Cited by

• Uncertainty Quantification for Visual Object Pose Estimation
• Atlas-based Manifold Representations for Interpretable Riemannian Machine Learning

Related

• Minimizing Polynomials via Sum of Squares over the Gradient Ideal
• Hesse's Redemption: Efficient Convex Polynomial Programming
• Upper Bounds on Resolvent Degree via Sylvester's Obliteration Algorithm
• An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities
• Exponential sum estimate for systems including linear polynomials