Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm
Proceedings of the 2008 ACM symposium on Applied computing
Moment matrices, trace matrices and the radical of ideals
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
A prolongation-projection algorithm for computing the finite real variety of an ideal
Theoretical Computer Science
Moments and sums of squares for polynomial optimization and related problems
Journal of Global Optimization
Theta Bodies for Polynomial Ideals
SIAM Journal on Optimization
On the computation of matrices of traces and radicals of ideals
Journal of Symbolic Computation
Moment matrices, border bases and real radical computation
Journal of Symbolic Computation
Computing real solutions of polynomial systems via low-rank moment matrix completion
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Border basis representation of a general quotient algebra
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Verified error bounds for real solutions of positive-dimensional polynomial systems
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Numerically Computing Real Points on Algebraic Sets
Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications
A Semidefinite Programming approach for solving Multiobjective Linear Programming
Journal of Global Optimization
Hi-index | 0.00 |
For an ideal I⊆ℝ[x] given by a set of generators, a new semidefinite characterization of its real radical I(V ℝ(I)) is presented, provided it is zero-dimensional (even if I is not). Moreover, we propose an algorithm using numerical linear algebra and semidefinite optimization techniques, to compute all (finitely many) points of the real variety V ℝ(I) as well as a set of generators of the real radical ideal. The latter is obtained in the form of a border or Gröbner basis. The algorithm is based on moment relaxations and, in contrast to other existing methods, it exploits the real algebraic nature of the problem right from the beginning and avoids the computation of complex components.