• Corpus ID: 11913006

Facial Reduction and SDP Methods for Systems of Polynomial Equations

  title={Facial Reduction and SDP Methods for Systems of Polynomial Equations},
  author={Gregory J. Reid and Fei Wang and Henry Wolkowicz and Wenyuan Wu},
The real radical ideal of a system of polynomials with finitely many complex roots is generated by a system of real polynomials having only real roots and free of multiplicities. It is a central object in computational real algebraic geometry and important as a preconditioner for numerical solvers. Lasserre and co-workers have shown that the real radical ideal of real polynomial systems with finitely many real solutions can be determined by a combination of semi-definite programming (SDP) and… 
5 Citations

Figures and Tables from this paper

Computing the generators of the truncated real radical ideal by moment matrices and SDP facial reduction
A method to compute the generators of the real radical for any given degree $d$, which combines the use of moment matrices and techniques from SDP optimization: facial reduction first developed by Borwein and Wolkowicz.
Finding Maximum Rank Moment Matrices by Facial Reduction and Douglas-Rachford Method on Primal Form
How to compute the moment matrix and its kernel using facial reduction techniques where the maximum rank property can be guaranteed by solving the dual problem is discussed.
Finding maximum rank moment matrices by facial reduction on primal form and Douglas-Rachford iteration
This work discusses how to compute the moment matrix and its kernel using facial reduction techniques where the maximum rank property can be guaranteed by solving the dual problem.
Facial Reduction for Symmetry Reduced Semidefinite Doubly Nonnegative Programs
This work considers both facial reduction, FR, and symmetry reduction, SR, techniques for semidefinite programming, SDP, and shows that the combination of FR and SR leads to a significant improvement in both numerical stability and running time for both the ADMM and interior point approaches.
Convex Relaxation For Hard Problem In Data Mining And Sensor Localization
Abstract : During the three-year period of the grant, the PI's discovered new, faster and more robust optimization solvers and also new methodologies for using optimization to find hidden structure


Computing real solutions of polynomial systems via low-rank moment matrix completion
In this paper, we propose a new algorithm for computing real roots of polynomial equations or a subset of real roots in a given semi-algebraic set described by additional polynomial inequalities. The
A prolongation-projection algorithm for computing the finite real variety of an ideal
Finding points on real solution components and applications to differential polynomial systems
The method can be used in the consistent initialization phase of a popular method due to Pryce and Pantelides for preprocessing differential algebraic equations for numerical solution.
Real solutions to equations from geometry
Real algebraic geometry studies real algebraic sets, i.e., real-number solutions to algebraic equations with real-number coefficients, and mappings between them (in particular, real polynomial
Handbook on semidefinite, conic and polynomial optimization
This paper presents an introduction to Semidefinite, Conic and Polynomial Optimization, and discusses Relaxations for Some Combinatorial Optimization Problems, and the State of theArt in Conic Optimization Software.
A certificate for semidefinite relaxations in computing positive dimensional real varieties
For an ideal I with a positive dimensional real variety, based on moment relaxations, we study how to compute a Pommaret basis which is simultaneously a Groebner basis of an ideal J generated by the
The approach of moments for polynomial equations
In this chapter we present the moment based approach for computing all real solutions of a given system of polynomial equations. This approach builds upon a lifting method for constructing
Involutive bases of polynomial ideals
The condition number of real Vandermonde, Krylov and positive definite Hankel matrices
  • B. Beckermann
  • Mathematics, Computer Science
    Numerische Mathematik
  • 2000
Summary. We show that the Euclidean condition number of any positive definite Hankel matrix of order $n\geq 3$ may be bounded from below by $\gamma^{n-1}/(16n)$ with $\gamma=\exp(4 \cdot{\it