The approach of moments for polynomial equations
From MaRDI portal
Publication:2802518
Recommendations
- Moment matrices, border bases and real radical computation
- Computing real solutions of polynomial systems via low-rank moment matrix completion
- scientific article; zbMATH DE number 7313221
- An introduction to polynomial and semi-algebraic optimization
- Moments, positive polynomials and their applications
Cites work
- scientific article; zbMATH DE number 5168255 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 1952043 (Why is no real title available?)
- scientific article; zbMATH DE number 1504686 (Why is no real title available?)
- scientific article; zbMATH DE number 2166957 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- scientific article; zbMATH DE number 2121334 (Why is no real title available?)
- scientific article; zbMATH DE number 3219899 (Why is no real title available?)
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- A generalized flat extension theorem for moment matrices
- 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
- Algorithms in real algebraic geometry
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Characterizations of border bases
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Generalized normal forms and polynomial system solving
- Global optimization with polynomials and the problem of moments
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Introduction to the solution of polynomial systems
- Khovanskii-Rolle continuation for real solutions
- Numerical Polynomial Algebra
- On the Momentum Problem for Distribution Functions in More Than One Dimension. II
- Real solutions to equations from geometry
- Revisiting two theorems of Curto and Fialkow on moment matrices
- Résolution des systèmes d'équations algébriques
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Solution of the truncated complex moment problem for flat data
- Solving polynomial equations. Foundations, algorithms, and applications
- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
- Solving zero-dimensional systems through the rational univariate representation
- Subdivision methods for solving polynomial equations
- Sums of squares, moment matrices and optimization over polynomials
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Thirty years of polynomial system solving, and now?
Cited in
(10)- A global approach for solving edge-matching puzzles
- Positive polynomials and semidefinite programming
- Flat extension and ideal projection
- Data analysis from empirical moments and the Christoffel function
- Computing real solutions of polynomial systems via low-rank moment matrix completion
- On the polynomial moment problem
- Linear optimization with cones of moments and nonnegative polynomials
- On the Fourier transform of the Hamming norm
- Approximation and interpolation of singular measures by trigonometric polynomials
- Computing real radicals by moment optimization
This page was built for publication: The approach of moments for polynomial equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802518)