A note on the representation of positive polynomials with structured sparsity

DOI10.1007/s00013-007-2234-zzbMath1194.13026arXivmath/0611498OpenAlexW2011603435MaRDI QIDQ2474124

Markus Schweighofer, David Grimm, Tim Netzer

Publication date: 5 March 2008

Published in: Archiv der Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

positive polynomialsum of squaressparse polynomialStructured sparsity

Mathematics Subject Classification ID

Sums of squares and representations by other particular quadratic forms (11E25) Semialgebraic sets and related spaces (14P10) Real algebra (13J30)

Related Items (13)

LP relaxations for a class of linear semi-infinite programming problems ⋮ Positive polynomials on fibre products ⋮ Sparse noncommutative polynomial optimization ⋮ Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables ⋮ Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity ⋮ A new scheme for approximating the weakly efficient solution set of vector rational optimization problems ⋮ Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks ⋮ A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization ⋮ Sum-of-squares chordal decomposition of polynomial matrix inequalities ⋮ Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables ⋮ LP Formulations for Polynomial Optimization Problems ⋮ Positive polynomials on projective limits of real algebraic varieties ⋮ Perturbed sums-of-squares theorem for polynomial optimization and its applications

This page was built for publication: A note on the representation of positive polynomials with structured sparsity