Discriminants and nonnegative polynomials

DOI10.1016/j.jsc.2011.08.023zbMath1245.14061arXiv1002.2230OpenAlexW1966518517MaRDI QIDQ655567

Jia-Wang Nie

Publication date: 4 January 2012

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.2230

zbMATH Keywords

hypersurfacesdiscriminantssemialgebraic setsbarrier function

Mathematics Subject Classification ID

Real algebraic sets (14P05) Computational aspects of algebraic surfaces (14Q10)

Related Items (26)

Amoebas, nonnegative polynomials and sums of squares supported on circuits ⋮ The Algebraic Boundary of the Sonc-Cone ⋮ Multivariate discriminant and iterated resultant ⋮ Positivity certificates and polynomial optimization on non-compact semialgebraic sets ⋮ Mixed discriminants ⋮ New examples of extremal positive linear maps ⋮ A Levenberg-Marquardt method for solving semi-symmetric tensor equations ⋮ Homogenization for polynomial optimization with unbounded sets ⋮ Optimality conditions and finite convergence of Lasserre's hierarchy ⋮ Volumes of Sublevel Sets of Nonnegative Forms and Complete Monotonicity ⋮ The role of non-negative polynomials for rank-one convexity and quasi convexity ⋮ An exact Jacobian SDP relaxation for polynomial optimization ⋮ Generalized truncated moment problems with unbounded sets ⋮ Quartic curves and their bitangents ⋮ The discriminant of a system of equations ⋮ Semidefinite relaxations for semi-infinite polynomial programming ⋮ Separating inequalities for nonnegative polynomials that are not sums of squares ⋮ The \(\mathcal A\)-truncated \(K\)-moment problem ⋮ Algebraic boundaries of Hilbert’s SOS cones ⋮ An iterative scheme for identifying the positive semi-definiteness of even-order real symmetric H-tensor ⋮ Discriminants of cyclic homogeneous inequalities of three variables ⋮ Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities ⋮ Lower and upper bounds for H-eigenvalues of even order real symmetric tensors ⋮ On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems ⋮ Tight relaxations for polynomial optimization and Lagrange multiplier expressions ⋮ Some properties of strong \(\mathcal{H}\)-tensors and general \(\mathcal{H}\)-tensors

Uses Software

• SINGULAR
• GloptiPoly
• YALMIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algebraic degree of semidefinite programming
• The \(K\)-moment problem for compact semi-algebraic sets
• Semidefinite programming relaxations for semialgebraic problems
• Minimizing polynomials via sum of squares over the gradient ideal
• Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry
• Global Optimization with Polynomials and the Problem of Moments
• On the convex hull of a space curve
• ORBITOPES
• GloptiPoly 3: moments, optimization and semidefinite programming
• Matrix Cubes Parameterized by Eigenvalues
• Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
• A general formula for the algebraic degree in semidefinite programming
• Algebraic Degree of Polynomial Optimization
• On the absence of uniform denominators in Hilbert’s 17th problem
• The maximum likelihood degree

This page was built for publication: Discriminants and nonnegative polynomials