SOS approximations of nonnegative polynomials via simple high degree perturbations
From MaRDI portal
Publication:883108
DOI10.1007/s00209-006-0061-8zbMath1122.13005arXivmath/0510456OpenAlexW2049225870MaRDI QIDQ883108
Tim Netzer, Jean-Bernard Lasserre
Publication date: 31 May 2007
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0510456
Semidefinite programming (90C22) Sums of squares and representations by other particular quadratic forms (11E25) Moment problems (44A60) Real algebra (13J30)
Related Items
Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets, Moments and sums of squares for polynomial optimization and related problems, Convexifying Positive Polynomials and Sums of Squares Approximation, Positivity certificates and polynomial optimization on non-compact semialgebraic sets, Convex sets with semidefinite representation, Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization, Globally trace-positive noncommutative polynomials and the unbounded tracial moment problem, The moment problem for continuous positive semidefinite linear functionals, Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations, Application of Jacobi's representation theorem to locally multiplicatively convex topological \(\mathbb R\)-algebras, Distributionally robust polynomial chance-constraints under mixture ambiguity sets, Positivstellensätze for quantum multigraphs, Positive semidefinite diagonal minus tail forms are sums of squares, A paradox in bosonic energy computations via semidefinite programming relaxations, Approximate optimal designs for multivariate polynomial regression, On solving a class of fractional semi-infinite polynomial programming problems, A generalization of Strassen’s Positivstellensatz, Lebesgue decomposition in action via semidefinite relaxations, Convex Optimization and Parsimony of $L_p$-balls Representation, Perturbed sums-of-squares theorem for polynomial optimization and its applications, On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems, The $\mathbf {K}$-moment problem for continuous linear functionals, A unified framework of SAGE and SONC polynomials and its duality theory, An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(K\)-moment problem for compact semi-algebraic sets
- Positive definite functions on Abelian semigroups
- Semidefinite programming relaxations for semialgebraic problems
- There are significantly more nonnegative polynomials than sums of squares
- Quasi-analytic vectors
- Global Optimization with Polynomials and the Problem of Moments
- Distinguished representations of strictly positive polynomials
- Positivity, sums of squares and the multi-dimensional moment problem
- Semidefinite Programming
- Optimization of Polynomials on Compact Semialgebraic Sets
- Sum of Squares Approximation of Polynomials, Nonnegative on a Real Algebraic Set
- A Sum of Squares Approximation of Nonnegative Polynomials
- Positivity, sums of squares and the multi-dimensional moment problem II
- On the Momentum Problem for Distribution Functions in More than One Dimension
- On the Momentum Problem for Distribution Functions in More Than One Dimension. II
