The \(\mathcal A\)-truncated \(K\)-moment problem

DOI10.1007/s10208-014-9225-9zbMath1331.65172arXiv1210.6930OpenAlexW2787555265MaRDI QIDQ486690

Jia-Wang Nie

Publication date: 16 January 2015

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

algorithmnumerical experimentflat extensioncompletely positive matrixtruncated moment problemsemidefinite program\(\mathcal A\)-truncated multisequencelocalizing matrixsums of even powers

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Applications of mathematical programming (90C90) Numerical methods for integral transforms (65R10) Linear operator methods in interpolation, moment and extension problems (47A57) Moment problems (44A60)

Related Items (54)

Separability of Hermitian tensors and PSD decompositions ⋮ Computing the distance between the linear matrix pencil and the completely positive cone ⋮ Flat extension and ideal projection ⋮ Bounding the separable rank via polynomial optimization ⋮ Completely positive tensor recovery with minimal nuclear value ⋮ Sparse noncommutative polynomial optimization ⋮ The truncated moment problem on the union of parallel lines ⋮ Certifying the global optimality of quartic minimization over the sphere ⋮ Minimizer Extraction in Polynomial Optimization Is Robust ⋮ Tensor eigenvalue complementarity problems ⋮ An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix ⋮ A factorization method for completely positive matrices ⋮ The strong truncated Hamburger moment problem with and without gaps ⋮ Completely positive factorization by a Riemannian smoothing method ⋮ Semidefinite Relaxation Methods for Tensor Absolute Value Equations ⋮ Partially positive matrices ⋮ Dehomogenization for completely positive tensors ⋮ Interiors of completely positive cones ⋮ Completely Positive Binary Tensors ⋮ Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks ⋮ A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization ⋮ 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 ⋮ Approximate optimal designs for multivariate polynomial regression ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ Hermitian Tensor Decompositions ⋮ The core variety of a multisequence in the truncated moment problem ⋮ A semidefinite algorithm for completely positive tensor decomposition ⋮ Tensor maximal correlation problems ⋮ On cones of nonnegative quartic forms ⋮ A simplex algorithm for rational cp-factorization ⋮ A hierarchy of semidefinite relaxations for completely positive tensor optimization problems ⋮ The CP-Matrix Approximation Problem ⋮ A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors ⋮ The truncated Hamburger moment problems with gaps in the index set ⋮ The multidimensional truncated moment problem: Carathéodory numbers from Hilbert functions ⋮ Constrained trace-optimization of polynomials in freely noncommuting variables ⋮ Stochastic polynomial optimization ⋮ Positive Maps and Separable Matrices ⋮ Monotonically positive matrices ⋮ Higher-degree tensor eigenvalue complementarity problems ⋮ A semidefinite relaxation algorithm for checking completely positive separable matrices ⋮ Estimation of multivariate generalized gamma convolutions through Laguerre expansions ⋮ Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space ⋮ Lower bounds on matrix factorization ranks via noncommutative polynomial optimization ⋮ T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method ⋮ A unified framework of SAGE and SONC polynomials and its duality theory ⋮ The maximum tensor complementarity eigenvalues ⋮ A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition ⋮ Distributionally robust optimization with moment ambiguity sets

Uses Software

• SeDuMi
• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• The truncated moment problem via homogenization and flat extensions
• On the computational complexity of membership problems for the completely positive cone and its dual
• Discriminants and nonnegative polynomials
• A note on the computation of the CP-rank
• An analogue of the Riesz-Haviland theorem for the truncated moment problem
• A semidefinite programming approach to the generalized problem of moments
• A generalized flat extension theorem for moment matrices
• Positivity of Riesz functionals and solutions of quadratic and quartic moment problems
• The \(K\)-moment problem for compact semi-algebraic sets
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• The maximal cp-rank of rank \(k\) completely positive matrices
• A semidefinite approach for truncated \(K\)-moment problems
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Certifying convergence of Lasserre's hierarchy via flat truncation
• New approximations for the cone of copositive matrices and its dual
• Global Optimization with Polynomials and the Problem of Moments
• Lectures on Modern Convex Optimization
• Approximation of the Stability Number of a Graph via Copositive Programming
• GloptiPoly 3: moments, optimization and semidefinite programming
• Semidefinite optimization
• Sums of even powers of real linear forms
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• Solution of the truncated complex moment problem for flat data
• Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices
• Revisiting two theorems of Curto and Fialkow on moment matrices
• The proof of Tchakaloff’s Theorem
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity

This page was built for publication: The \(\mathcal A\)-truncated \(K\)-moment problem