The approach of moments for polynomial equations
From MaRDI portal
Publication:2802518
DOI10.1007/978-1-4614-0769-0_2zbMATH Open1334.90111OpenAlexW1529712732MaRDI QIDQ2802518FDOQ2802518
Authors: Philipp Rostalski, Monique Laurent 
Publication date: 26 April 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_2
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
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22)
Cites Work
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- Sums of squares, moment matrices and optimization over polynomials
- Algorithms in real algebraic geometry
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Solving zero-dimensional systems through the rational univariate representation
- Real solutions to equations from geometry
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- A generalized flat extension theorem for moment matrices
- Title not available (Why is that?)
- Numerical Polynomial Algebra
- Solution of the truncated complex moment problem for flat data
- Generalized normal forms and polynomial system solving
- Revisiting two theorems of Curto and Fialkow on moment matrices
- Introduction to the solution of polynomial systems
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Solving polynomial equations. Foundations, algorithms, and applications
- Khovanskii-Rolle continuation for real solutions
- Characterizations of border bases
- Title not available (Why is that?)
- Subdivision methods for solving polynomial equations
- Résolution des systèmes d'équations algébriques
- Title not available (Why is that?)
- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
- Thirty years of polynomial system solving, and now?
- 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
- On the Momentum Problem for Distribution Functions in More Than One Dimension. II
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- A global approach for solving edge-matching puzzles
- Positive polynomials and semidefinite programming
- Flat extension and ideal projection
- Computing real solutions of polynomial systems via low-rank moment matrix completion
- Data analysis from empirical moments and the Christoffel function
- On the polynomial moment problem
- On the Fourier transform of the Hamming norm
- Linear optimization with cones of moments and nonnegative polynomials
- Approximation and interpolation of singular measures by trigonometric polynomials
- Computing real radicals by moment optimization
Uses Software
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)
