Polynomial Optimization with Real Varieties

DOI10.1137/120898772zbMath1286.65079arXiv1211.1940OpenAlexW2963819442MaRDI QIDQ2866200

Jia-Wang Nie

Publication date: 13 December 2013

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

finite convergencepolynomial optimizationsum of squaressemidefinite programLasserre's hierarchyreal variety

Mathematics Subject Classification ID

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

Related Items (33)

Local saddle points for unconstrained polynomial optimization ⋮ Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph ⋮ The saddle point problem of polynomials ⋮ Tensor eigenvalue complementarity problems ⋮ Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints ⋮ Homogenization for polynomial optimization with unbounded sets ⋮ A new approximation hierarchy for polynomial conic optimization ⋮ A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors ⋮ Semidefinite Relaxation Methods for Tensor Absolute Value Equations ⋮ Optimality conditions and finite convergence of Lasserre's hierarchy ⋮ Equality-constrained minimization of polynomial functions ⋮ A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization ⋮ An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization ⋮ Quadratic tensor eigenvalue complementarity problems ⋮ Real Radicals and Finite Convergence of Polynomial Optimization Problems ⋮ Convex generalized Nash equilibrium problems and polynomial optimization ⋮ A semidefinite method for tensor complementarity problems ⋮ Real eigenvalues of nonsymmetric tensors ⋮ Tensor maximal correlation problems ⋮ An SDP method for copositivity of partially symmetric tensors ⋮ Well-Posedness in Unconstrained Polynomial Optimization Problems ⋮ Solving the equality-constrained minimization problem of polynomial functions ⋮ A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems ⋮ Tensor \(Z\)-eigenvalue complementarity problems ⋮ Stochastic polynomial optimization ⋮ Positive Maps and Separable Matrices ⋮ A semidefinite relaxation method for second-order cone polynomial complementarity problems ⋮ Higher-degree tensor eigenvalue complementarity problems ⋮ Saddle points of rational functions ⋮ Test of copositive tensors ⋮ An efficient alternating minimization method for fourth degree polynomial optimization ⋮ Tight relaxations for polynomial optimization and Lagrange multiplier expressions ⋮ The maximum tensor complementarity eigenvalues

This page was built for publication: Polynomial Optimization with Real Varieties