Semidefinite Approximations for Global Unconstrained Polynomial Optimization
From MaRDI portal
Publication:5470206
DOI10.1137/04060562XzbMath1103.90073OpenAlexW2001098796MaRDI QIDQ5470206
Dorina Jibetean, Monique Laurent
Publication date: 30 May 2006
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/04060562x
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Numerical methods of relaxation type (49M20)
Related Items
Positivity certificates and polynomial optimization on non-compact semialgebraic sets, Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals, Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems, Solving polynomial least squares problems via semidefinite programming relaxations, Semidefinite representations for finite varieties, On the complexity of Putinar's Positivstellensatz, Strong duality and minimal representations for cone optimization, Generic Properties for Semialgebraic Programs, A Frank-Wolfe type theorem for nondegenerate polynomial programs, On polynomial optimization over non-compact semi-algebraic sets, An alternative approach for nonlinear optimal control problems based on the method of moments, Proving inequalities and solving global optimization problems via simplified CAD projection, Exact relaxations of non-convex variational problems, Global minimization of rational functions and the nearest GCDs, Well-Posedness in Unconstrained Polynomial Optimization Problems, Coarse-Convex-Compactification Approach to Numerical Solution of Nonconvex Variational Problems, Minimizing polynomials via sum of squares over the gradient ideal, Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations, SDP Relaxations for Non-Commutative Polynomial Optimization, Perturbed sums-of-squares theorem for polynomial optimization and its applications, An efficient algorithm for range computation of polynomials using the Bernstein form
Uses Software
