An exact Jacobian SDP relaxation for polynomial optimization

DOI10.1007/S10107-011-0489-4zbMath1266.65094arXiv1006.2418OpenAlexW2057170710MaRDI QIDQ1942264

Jia-Wang Nie

Publication date: 18 March 2013

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

polynomial optimizationsum of squaressemidefinite programming relaxation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22)

Related Items (34)

Local saddle points for unconstrained polynomial optimization ⋮ Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets ⋮ Certifying the global optimality of quartic minimization over the sphere ⋮ Bilevel Polynomial Programs and Semidefinite Relaxation Methods ⋮ Homogenization for polynomial optimization with unbounded sets ⋮ A practical approach to SOS relaxations for detecting quantum entanglement ⋮ A new approximation hierarchy for polynomial conic optimization ⋮ Optimality conditions and finite convergence of Lasserre's hierarchy ⋮ Equality-constrained minimization of polynomial functions ⋮ Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization ⋮ Generic Properties for Semialgebraic Programs ⋮ Certifying convergence of Lasserre's hierarchy via flat truncation ⋮ Semidefinite relaxations for semi-infinite polynomial programming ⋮ Global optimization of polynomials over real algebraic sets ⋮ Calculating entanglement eigenvalues for nonsymmetric quantum pure states based on the Jacobian semidefinite programming relaxation method ⋮ Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation ⋮ Semidefinite Optimization Estimating Bounds on Linear Functionals Defined on Solutions of Linear ODEs ⋮ An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming ⋮ Real eigenvalues of nonsymmetric tensors ⋮ Tensor maximal correlation problems ⋮ Intrinsic complexity estimates in polynomial optimization ⋮ An improved semidefinite programming hierarchy for testing entanglement ⋮ On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems ⋮ Well-Posedness in Unconstrained Polynomial Optimization Problems ⋮ Solving the equality-constrained minimization problem of polynomial functions ⋮ Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique ⋮ Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities ⋮ Positive Maps and Separable Matrices ⋮ Linear optimization with cones of moments and nonnegative polynomials ⋮ On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems ⋮ An efficient alternating minimization method for fourth degree polynomial optimization ⋮ Tight relaxations for polynomial optimization and Lagrange multiplier expressions ⋮ Semidefinite Representations of Noncompact Convex Sets ⋮ A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition

Uses Software

• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discriminants and nonnegative polynomials
• Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
• On the complexity of Putinar's Positivstellensatz
• On the complexity of Schmüdgen's Positivstellensatz
• The \(K\)-moment problem for compact semi-algebraic sets
• Determinantal rings
• Minimizing polynomials via sum of squares over the gradient ideal
• Global Optimization with Polynomials and the Problem of Moments
• Global optimization of polynomials using generalized critical values and sums of squares
• GloptiPoly 3: moments, optimization and semidefinite programming
• Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
• Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
• Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• Sums of squares of regular functions on real algebraic varieties
• The truncated complex $K$-moment problem
• The Number of Equations Defining a Determinantal Variety
• Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares

This page was built for publication: An exact Jacobian SDP relaxation for polynomial optimization