Optimization of Polynomial Functions
From MaRDI portal
Publication:4467291
DOI10.4153/CMB-2003-054-7zbMath1063.14071MaRDI QIDQ4467291
Publication date: 9 June 2004
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Semidefinite programming (90C22) Moment problems (44A60) Semialgebraic sets and related spaces (14P10)
Related Items (20)
Nonnegative Morse polynomial functions and polynomial optimization ⋮ Representations of non-negative polynomials having finitely many zeros ⋮ Completely positive tensor recovery with minimal nuclear value ⋮ Certifying the global optimality of quartic minimization over the sphere ⋮ On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices ⋮ Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph ⋮ Real ideal and the duality of semidefinite programming for polynomial optimization ⋮ Semidefinite representations for finite varieties ⋮ On the complexity of Putinar's Positivstellensatz ⋮ On the complexity of Schmüdgen's Positivstellensatz ⋮ On the complexity of testing attainment of the optimal value in nonlinear optimization ⋮ Symmetric Tensor Nuclear Norms ⋮ Coercive polynomials: stability, order of growth, and Newton polytopes ⋮ Sum-of-Squares Optimization without Semidefinite Programming ⋮ Norm bounds and underestimators for unconstrained polynomial integer minimization ⋮ Compactness criteria for real algebraic sets and Newton polyhedra ⋮ Minimizing polynomials via sum of squares over the gradient ideal ⋮ On stability and the Łojasiewicz exponent at infinity of coercive polynomials ⋮ Solving polynomial optimization problems via the truncated tangency variety and sums of squares ⋮ Semidefinite Representations of Noncompact Convex Sets
This page was built for publication: Optimization of Polynomial Functions
