Linear optimization with cones of moments and nonnegative polynomials

DOI10.1007/s10107-014-0797-6zbMath1327.65113arXiv1305.2970OpenAlexW1985650248MaRDI QIDQ745685

Jia-Wang Nie

Publication date: 14 October 2015

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

algorithmconvergencemomentlinear optimizationsum of squaresrepresenting measuresemidefinite programnonnegative polynomialtruncated moment sequence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26)

Related Items (35)

Local saddle points for unconstrained polynomial optimization ⋮ Separability of Hermitian tensors and PSD decompositions ⋮ Learning diagonal Gaussian mixture models and incomplete tensor decompositions ⋮ Computing the distance between the linear matrix pencil and the completely positive cone ⋮ Completely positive tensor recovery with minimal nuclear value ⋮ Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems ⋮ The saddle point problem of polynomials ⋮ Tensor eigenvalue complementarity problems ⋮ Semidefinite Relaxation Methods for Tensor Absolute Value Equations ⋮ Dehomogenization for completely positive tensors ⋮ Completely Positive Binary Tensors ⋮ Rational Generalized Nash Equilibrium Problems ⋮ A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization ⋮ A utopia point method-based robust vector polynomial optimization scheme ⋮ Generalized truncated moment problems with unbounded sets ⋮ Hermitian completely positive matrices ⋮ Completely positive tensors in the complex field ⋮ Quadratic tensor eigenvalue complementarity problems ⋮ Convex generalized Nash equilibrium problems and polynomial optimization ⋮ Symmetric Tensor Nuclear Norms ⋮ Hermitian Tensor Decompositions ⋮ A semidefinite algorithm for completely positive tensor decomposition ⋮ Tensor maximal correlation problems ⋮ Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization ⋮ A hierarchy of semidefinite relaxations for completely positive tensor optimization problems ⋮ The CP-Matrix Approximation Problem ⋮ The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials ⋮ Stochastic polynomial optimization ⋮ Positive Maps and Separable Matrices ⋮ Higher-degree tensor eigenvalue complementarity problems ⋮ Saddle points of rational functions ⋮ A semidefinite relaxation algorithm for checking completely positive separable matrices ⋮ Tight relaxations for polynomial optimization and Lagrange multiplier expressions ⋮ The maximum tensor complementarity eigenvalues ⋮ Distributionally robust optimization with moment ambiguity sets

Uses Software

• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality conditions and finite convergence of Lasserre's hierarchy
• A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
• The truncated moment problem via homogenization and flat extensions
• Semidefinite representation of convex sets
• Semidefinite representations for finite varieties
• On the complexity of Putinar's Positivstellensatz
• A semidefinite programming approach to the generalized problem of moments
• A prolongation-projection algorithm for computing the finite real variety of an ideal
• Semidefinite characterization and computation of zero-dimensional real radical ideals
• Semidefinite programming relaxations for semialgebraic problems
• A semidefinite approach for truncated \(K\)-moment problems
• An exact Jacobian SDP relaxation for polynomial optimization
• Convex sets with semidefinite representation
• Certifying convergence of Lasserre's hierarchy via flat truncation
• Global Optimization with Polynomials and the Problem of Moments
• Lectures on Modern Convex Optimization
• The Approach of Moments for Polynomial Equations
• Convex Hulls of Algebraic Sets
• The CP-Matrix Completion Problem
• Exposed Faces of Semidefinitely Representable Sets
• Theta Bodies for Polynomial Ideals
• Positive Polynomials and Projections of Spectrahedra
• GloptiPoly 3: moments, optimization and semidefinite programming
• Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
• Convexity in SemiAlgebraic Geometry and Polynomial Optimization
• Probability Measures on Compact Sets
• Sums of even powers of real linear forms
• Flat extensions of positive moment matrices: recursively generated relations
• Semidefinite Representation for Convex Hulls of Real Algebraic Curves
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• Solution of the truncated complex moment problem for flat data
• Algebraic Degree of Polynomial Optimization
• Revisiting two theorems of Curto and Fialkow on moment matrices

This page was built for publication: Linear optimization with cones of moments and nonnegative polynomials