Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
From MaRDI portal
Publication:816068
DOI10.1007/S10898-005-2099-2zbMATH Open1097.90039arXivmath/0411122OpenAlexW2090225690MaRDI QIDQ816068FDOQ816068
Publication date: 20 February 2006
Published in: Journal of Global Optimization (Search for Journal in Brave)
Abstract: This paper has been withdrawn by the authors due to its publication
Full work available at URL: https://arxiv.org/abs/math/0411122
Semidefinite programming (SDP)PerturbationEllipsoidPolynomial systemReal algebraic geometrySum of squares (SOS)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global optimization with polynomials and the problem of moments
- The \(K\)-moment problem for compact semi-algebraic sets
- Semidefinite programming relaxations for semialgebraic problems
- SOSTOOLS and Its Control Applications
- Complexity estimates for the Schmüdgen Positivstellensatz
- On the complexity of Schmüdgen's Positivstellensatz
- A representation theorem for certain partially ordered commutative rings
- Ellipsoidal bounds for uncertain linear equations and dynamical systems
Cited In (5)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
- Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Global optimality conditions and optimization methods for polynomial programming problems
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Minimizing polynomials via sum of squares over the gradient ideal 👍 👎
- Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces 👍 👎
- Ellipsoid Bounds for Convex Quadratic Integer Programming 👍 👎
- Extensions on ellipsoid bounds for quadratic integer programming 👍 👎
- Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities 👍 👎
- On well-posedness of quadratic minimization problem on ellipsoid and polyhedron 👍 👎
- On minimizing the ratio of quadratic functions over an ellipsoid 👍 👎
This page was built for publication: Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q816068)
