Moment matrices, border bases and real radical computation

@article{Lasserre2013MomentMB,
  title={Moment matrices, border bases and real radical computation},
  author={Jean B. Lasserre and Monique Laurent and Bernard Mourrain and Philipp Rostalski and Philippe Trebuchet},
  journal={J. Symb. Comput.},
  year={2013},
  volume={51},
  pages={63-85}
}
Computing Real Radicals by Moment Optimization
TLDR
A new algorithm for computing the real radical of an ideal I and, more generally, the S-radical of I is presented, which is based on convex moment optimization, and an effective, general stopping criterion is given on the degree to detect when the prime ideals lying over the annihilator are real.
On exact Reznick, Hilbert-Artin and Putinar's representations
On the Complexity of Computing Real Radicals of Polynomial Systems
TLDR
A probabilistic algorithm of complexity sO(1) (nD)O(nr2r) to compute rational parametrizations for all irreducible components of the real algebraic set V ∩ Rn is given.
On Exact Polya, Hilbert-Artin and Putinar's Representations
TLDR
This work provides a hybrid numeric-symbolic algorithm computing exact rational SOS decompositions for polynomials lying in the interior of the SOS cone, and proves that bit complexity estimates on output size and runtime are both polynomial in the degree of the inputPolynomial and simply exponential in the number of variables.
On Exact Polya and Putinar's Representations
TLDR
This work provides a hybrid numeric-symbolic algorithm computing exact rational SOS decompositions for polynomials lying in the interior of the SOS cone and proves that bit complexity estimates on output size and runtime are both polynomial in the degree of the inputPolynomial and simply exponential in the number of variables.
Multivariate moment problems : applications of the reconstruction of linear forms on the polynomial ring
This thesis deals with the reconstruction of linear forms on the polynomial ring and its applications. We propose theoretical and algorithmic tools to solve multivariate moment problems: the
Certified relaxation for polynomial optimization on semi-algebraic sets
In this paper, we describe a relaxation method to compute the minimal critical value of a real polynomial function on a semialgebraic set S and the ideal defining the points at which the minimal
Exact relaxation for polynomial optimization on semi-algebraic sets
TLDR
This paper shows that when the infimum of a real polynomial function f on a closed basic semialgebraic set and the points where this infimum is reached, a relaxation hierarchy constructed from the Karush-Kuhn-Tucker ideal is always exact and that the vanishing ideal of the KKT minimizer points is generated by the kernel of the associated moment matrix in that degree.
Border basis relaxation for polynomial optimization
...
...

References

SHOWING 1-10 OF 31 REFERENCES
Semidefinite characterization and computation of real radical ideals
TLDR
An algorithm using numerical linear algebra and semidefinite optimization techniques, to compute all (finitely many) points of the real variety VR(I) as well as a set of generators of thereal radical ideal I(VR(I), provided it is zero-dimensional (even if I is not).
A Gröbner Free Alternative for Polynomial System Solving
TLDR
A new generation of probabilistic algorithms where all the computations use only univariate or bivariate polynomials are introduced, and a new codification of the set of solutions of a positive dimensional algebraic variety is given relying on a new global version of Newton's iterator.
Generalized normal forms and polynomial system solving
TLDR
A new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I, which weaken the monomial ordering requirement for bases computations, which allows us to construct new type of representations for the quotient algebra.
Solving Zero-Dimensional Systems Through the Rational Univariate Representation
  • F. Rouillier
  • Mathematics, Computer Science
    Applicable Algebra in Engineering, Communication and Computing
  • 1999
TLDR
It is shown that the solutions of any zero-dimensional system of polynomials can be expressed through a special kind of univariate representation (Rational Univariate Representation): where (f,g,g1, …,gn) are polynmials of K[X1,…, Xn].
A New Criterion for Normal Form Algorithms
TLDR
A criterion, which gives a necessary and sufficient condition for a projection onto a set of polynomials, to be a normal form modulo the ideal I, is presented, which leads to a newa l algorithm for constructing the multiplicative structure of a zero-dimensional algebra.
Resolution des Systemes d'Equations Algebriques
Multihomogeneous polynomial decomposition using moment matrices
TLDR
The problem of tensor decomposition is addressed, how to reduce the problem to a truncated moment matrix problem and a new criterion for flat extension of Quasi-Hankel matrices is given, connected to the commutation characterisation of border bases.
Real algebraic geometry
1. Ordered Fields, Real Closed Fields.- 2. Semi-algebraic Sets.- 3. Real Algebraic Varieties.- 4. Real Algebra.- 5. The Tarski-Seidenberg Principle as a Transfer Tool.- 6. Hilbert's 17th Problem.
A generalized flat extension theorem for moment matrices
In this note we prove a generalization of the flat extension theorem of Curto and Fialkow (Memoirs of the American Mathematical Society, vol. 119. American Mathematical Society, Providence, 1996) for
Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation
TLDR
The structure and design of the software package PHC is described, which features great variety of root-counting methods among its tools and is ensured by the gnu-ada compiler.
...
...