The CP-Matrix Approximation Problem
From MaRDI portal
Publication:2790067
DOI10.1137/15M1012086zbMath1382.90072arXiv1411.0795MaRDI QIDQ2790067
Publication date: 2 March 2016
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.0795
completely positive matriceslinear optimization with momentssemidefinite algorithmCP-matrix approximation
Factorization of matrices (15A23) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Positive matrices and their generalizations; cones of matrices (15B48) Moment problems (44A60)
Related Items (2)
Dehomogenization for completely positive tensors ⋮ A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
Uses Software
Cites Work
- 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
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Linear optimization with cones of moments and nonnegative polynomials
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- Copositive programming motivated bounds on the stability and the chromatic numbers
- On the complexity of Putinar's Positivstellensatz
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A semidefinite approach for truncated \(K\)-moment problems
- Factorization and cutting planes for completely positive matrices by copositive projection
- Global Optimization with Polynomials and the Problem of Moments
- Lectures on Modern Convex Optimization
- The CP-Matrix Completion Problem
- GloptiPoly 3: moments, optimization and semidefinite programming
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
- Some NP-complete problems in quadratic and nonlinear programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Algebraic Degree of Polynomial Optimization
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- A Copositive Programming Approach to Graph Partitioning
- On copositive programming and standard quadratic optimization problems
This page was built for publication: The CP-Matrix Approximation Problem
