A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals
From MaRDI portal
(Redirected from Publication:492020)
Abstract: For an ideal I with a positive dimensional real variety, based on moment relaxations, we study how to compute a Pommaret basis which is simultaneously a Groebner basis of an ideal J generated by the kernel of a truncated moment matrix and nesting between I and its real radical ideal. We provide a certificate consisting of a condition on coranks of moment matrices for terminating the algorithm. For a generic delta-regular coordinate system, we prove that the condition is satisfiable in a large enough order of moment relaxations.
Recommendations
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Computation of generalized real radicals of polynomial ideals
- Moment matrices, border bases and real radical computation
- scientific article; zbMATH DE number 833249
- Computing real radicals and \(S\)-radicals of polynomial systems
Cites work
- scientific article; zbMATH DE number 421675 (Why is no real title available?)
- scientific article; zbMATH DE number 4029737 (Why is no real title available?)
- scientific article; zbMATH DE number 177873 (Why is no real title available?)
- scientific article; zbMATH DE number 2151204 (Why is no real title available?)
- scientific article; zbMATH DE number 2121334 (Why is no real title available?)
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- A unified approach to computing real and complex zeros of zero-dimensional ideals
- An algorithm for isolating the real solutions of semi-algebraic systems
- Computation of generalized real radicals of polynomial ideals
- Computation of real radicals of polynomial ideals. II
- Geometric involutive bases and applications to approximate commutative algebra
- GloptiPoly
- Gröbner bases and primary decomposition of polynomial ideals
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Involution. The formal theory of differential equations and its applications in computer algebra
- Moment matrices, border bases and real radical computation
- Numerical Polynomial Algebra
- On computing a set of points meeting every cell defined by a family of polynomials on a variety
- On the complexity of the real Nullstellensatz in the 0-dimensional case
- On the computation of matrices of traces and radicals of ideals
- Polar varieties and efficient real elimination
- Positive polynomials and sums of squares
- Radical computations of zero-dimensional ideals and real root counting.
- Real solving for positive dimensional systems.
- Regularity of ideals and their radicals
- Revisiting two theorems of Curto and Fialkow on moment matrices
- Semidefinite Programming
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Solution of the truncated complex moment problem for flat data
- Solution of the truncated moment problem with variety 𝑦=𝑥³
- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
- Sums of squares, moment matrices and optimization over polynomials
Cited in
(5)
This page was built for publication: A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492020)
