Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization

From MaRDI portal
Publication:3624527

DOI10.4153/CJM-2009-010-4zbMath1163.13019OpenAlexW2153170581MaRDI QIDQ3624527

Murray A. Marshall

Publication date: 30 April 2009

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-2009-010-4



Related Items

Nonnegative Morse polynomial functions and polynomial optimization, Set-membership errors-in-variables identification of MIMO linear systems, Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph, A bounded degree SOS hierarchy for polynomial optimization, Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness, Lower bounds for a polynomial in terms of its coefficients, One-shot set-membership identification of generalized Hammerstein-Wiener systems, Optimality conditions and finite convergence of Lasserre's hierarchy, A unified framework for the identification of a general class of multivariable nonlinear block‐structured systems, Border basis relaxation for polynomial optimization, An exact Jacobian SDP relaxation for polynomial optimization, Generic Properties for Semialgebraic Programs, A Frank-Wolfe type theorem for nondegenerate polynomial programs, On polynomial optimization over non-compact semi-algebraic sets, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, Semidefinite Optimization Estimating Bounds on Linear Functionals Defined on Solutions of Linear ODEs, Norm bounds and underestimators for unconstrained polynomial integer minimization, Well-Posedness in Unconstrained Polynomial Optimization Problems, A survey on conic relaxations of optimal power flow problem, Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes, Exploiting sparsity in complex polynomial optimization