Semidefinite Characterization and Computation of Real Radical Ideals
Algebraic Geometry
2018-11-20 v2 Optimization and Control
Abstract
For an ideal given by a set of generators, a new semidefinite characterization of its real radical is presented, provided it is zero-dimensional (even if 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 as well as a set of generators of the real radical ideal. The latter is obtained in the form of a border or Gr\"obner 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.
Cite
@article{arxiv.math/0609528,
title = {Semidefinite Characterization and Computation of Real Radical Ideals},
author = {J. B. Lasserre and M. Laurent and P. Rostalski},
journal= {arXiv preprint arXiv:math/0609528},
year = {2018}
}
Comments
41 pages