Positive polynomials on projective limits of real algebraic varieties

DOI10.1016/j.bulsci.2008.06.001zbMath1173.14343OpenAlexW2018580276MaRDI QIDQ998968

Mihai Putinar, Salma Kuhlmann

Publication date: 30 January 2009

Published in: Bulletin des Sciences Mathématiques (Search for Journal in Brave)

Full work available at URL: http://purl.umn.edu/4365

zbMATH Keywords

moment problemprojective limitnon-convex optimizationpositive polynomialfibre product

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Semialgebraic sets and related spaces (14P10)

Related Items (1)

Projective limit techniques for the infinite dimensional moment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
• The \(K\)-moment problem for compact semi-algebraic sets
• Approximation de fonctions holomorphes d'un nombre infini de variables. (Approximation of holomorphic functions of infinitely many variables.)
• Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
• Sparsity in sums of squares of polynomials
• A note on the representation of positive polynomials with structured sparsity
• Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
• Global Optimization with Polynomials and the Problem of Moments
• The moment problem for non-compact semialgebraic sets
• Positivity, sums of squares and the multi-dimensional moment problem
• Sums of squares and moment problems in equivariant situations
• Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
• Sums of even powers of real linear forms
• On the moment problem of closed semi-algebraic sets
• Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• The proof of Tchakaloff’s Theorem
• State Constraints in Convex Control Problems of Bolza
• Positivity, sums of squares and the multi-dimensional moment problem II
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity

This page was built for publication: Positive polynomials on projective limits of real algebraic varieties