Matrix factorization ranks via polynomial optimization

Cites work

scientific article; zbMATH DE number 3826531 (Why is no real title available?)
scientific article; zbMATH DE number 193944 (Why is no real title available?)
scientific article; zbMATH DE number 1282443 (Why is no real title available?)
scientific article; zbMATH DE number 729680 (Why is no real title available?)
scientific article; zbMATH DE number 1933860 (Why is no real title available?)
scientific article; zbMATH DE number 1489799 (Why is no real title available?)
A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
Algorithm 457: finding all cliques of an undirected graph
Approximation theory and approximation practice
Bounding the separable rank via polynomial optimization
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
Completely positive matrices associated withM-matrices
Copositive and completely positive matrices
Detecting Global Optimality and Extracting Solutions in GloptiPoly
Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
Exponential lower bounds for polytopes in combinatorial optimization
From seven to eleven: completely positive matrices with high cp-rank
JuMP: a modeling language for mathematical optimization
Julia: a fresh approach to numerical computing
Learning the parts of objects by non-negative matrix factorization
Lifting for simplicity: concise descriptions of convex sets
Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
Mixed states in one spatial dimension: decompositions and correspondence with nonnegative matrices
New lower bounds and asymptotics for the cp-rank
On the complexity of nonnegative matrix factorization
On the computational complexity of membership problems for the completely positive cone and its dual
On the copositive representation of binary and continuous nonconvex quadratic programs
On the cp-rank and minimal cp factorizations of a completely positive matrix
On the geometric interpretation of the nonnegative rank
Positive semidefinite rank
Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
Solution of the truncated complex moment problem for flat data
Strong NP-hardness of the quantum separability problem
Sums of squares, moment matrices and optimization over polynomials
Tensor Decompositions and Applications
The \(\mathcal A\)-truncated \(K\)-moment problem
The truncated complex K-moment problem

This page was built for publication: Matrix factorization ranks via polynomial optimization

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