A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals
From MaRDI portal
Publication:492020
DOI10.1016/j.jsc.2014.12.002zbMath1444.13036arXiv1212.4924MaRDI QIDQ492020
Publication date: 19 August 2015
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.4924
semidefinite programming; \(\delta\)-regular; involutive division; Pommaret basis; positive-dimensional ideal; real radical ideal
68W30: Symbolic computation and algebraic computation
90C22: Semidefinite programming
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
13P15: Solving polynomial systems; resultants
Related Items
Voronoi cells of varieties, Generators for the \(C^m\)-closures of ideals, Smooth points on semi-algebraic sets, Computing real radicals and \(S\)-radicals of polynomial systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the computation of matrices of traces and radicals of ideals
- Regularity of ideals and their radicals
- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
- Involution. The formal theory of differential equations and its applications in computer algebra
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Gröbner bases and primary decomposition of polynomial ideals
- Computation of generalized real radicals of polynomial ideals
- On computing a set of points meeting every cell defined by a family of polynomials on a variety
- Computation of real radicals of polynomial ideals. II
- Radical computations of zero-dimensional ideals and real root counting.
- On the complexity of the real Nullstellensatz in the 0-dimensional case
- An algorithm for isolating the real solutions of semi-algebraic systems
- Real solving for positive dimensional systems.
- Moment matrices, border bases and real radical computation
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- Solution of the truncated moment problem with variety 𝑦=𝑥³
- Geometric Involutive Bases and Applications to Approximate Commutative Algebra
- Numerical Polynomial Algebra
- Solution of the truncated complex moment problem for flat data
- Semidefinite Programming
- GloptiPoly
- Revisiting two theorems of Curto and Fialkow on moment matrices
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Polar varieties and efficient real elimination
