Positive polynomials on projective limits of real algebraic varieties

DOI10.1016/J.BULSCI.2008.06.001MaRDI QIDQ998968zbMATH OpenOpenAlexFDO

Authors Salma Kuhlmann, Mihai Putinar

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

non-convex optimizationmoment problempositive polynomialprojective limitfibre product

Mathematics Subject Classification ID

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

Recommendations

• Positive polynomials on fibre products
• Positive polynomials and projections of spectrahedra
• Positive polynomials in scalar and matrix variables, the spectral theorem, and optimization
• Real algebraic geometry and its applications
• Free convex algebraic geometry

Cites work

• scientific article; zbMATH DE number 1601019 (Why is no real title available?)
• scientific article; zbMATH DE number 3115404 (Why is no real title available?)
• scientific article; zbMATH DE number 4158856 (Why is no real title available?)
• scientific article; zbMATH DE number 3572315 (Why is no real title available?)
• scientific article; zbMATH DE number 527343 (Why is no real title available?)
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 3286429 (Why is no real title available?)
• scientific article; zbMATH DE number 3301795 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
• A note on the representation of positive polynomials with structured sparsity
• Approximation de fonctions holomorphes d'un nombre infini de variables. (Approximation of holomorphic functions of infinitely many variables.)
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
• Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
• Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
• Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
• Global optimization with polynomials and the problem of moments
• On the moment problem of closed semi-algebraic sets
• Positive polynomials in scalar and matrix variables, the spectral theorem, and optimization
• Positivity, sums of squares and the multi-dimensional moment problem
• Positivity, sums of squares and the multi-dimensional moment problem II
• Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
• Sparsity in sums of squares of polynomials
• State Constraints in Convex Control Problems of Bolza
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• Sums of even powers of real linear forms
• Sums of squares and moment problems in equivariant situations
• The K-moment problem for compact semi-algebraic sets
• The moment problem for non-compact semialgebraic sets
• The proof of Tchakaloff’s Theorem

Cited in

(2)

• Projective limit techniques for the infinite dimensional moment problem
• Positive polynomials on fibre products

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998968)