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

From MaRDI portal
Revision as of 04:56, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (23)

Nonnegative Morse polynomial functions and polynomial optimizationRepresentations of non-negative polynomials having finitely many zerosSet-membership errors-in-variables identification of MIMO linear systemsFinite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a GraphA bounded degree SOS hierarchy for polynomial optimizationConvergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactnessLower bounds for a polynomial in terms of its coefficientsOne-shot set-membership identification of generalized Hammerstein-Wiener systemsOptimality conditions and finite convergence of Lasserre's hierarchyA unified framework for the identification of a general class of multivariable nonlinear block‐structured systemsBorder basis relaxation for polynomial optimizationAn exact Jacobian SDP relaxation for polynomial optimizationGeneric Properties for Semialgebraic ProgramsA Frank-Wolfe type theorem for nondegenerate polynomial programsA version of Putinar's Positivstellensatz for cylindersOn polynomial optimization over non-compact semi-algebraic setsCopositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017Semidefinite Optimization Estimating Bounds on Linear Functionals Defined on Solutions of Linear ODEsNorm bounds and underestimators for unconstrained polynomial integer minimizationWell-Posedness in Unconstrained Polynomial Optimization ProblemsA survey on conic relaxations of optimal power flow problemSum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-PolytopesExploiting sparsity in complex polynomial optimization







This page was built for publication: Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization