Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
From MaRDI portal
Publication:304255
DOI10.1007/s10107-015-0937-7zbMath1346.90662arXiv1404.3240OpenAlexW1603610938MaRDI QIDQ304255
Publication date: 25 August 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.3240
Factorization of matrices (15A23) Convex programming (90C25) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items
Algebraic boundary of matrices of nonnegative rank at most three, Bounding the separable rank via polynomial optimization, Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes, Dimension reduction for semidefinite programs via Jordan algebras, Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks, Positive semidefinite rank and nested spectrahedra, Mixed states in one spatial dimension: Decompositions and correspondence with nonnegative matrices, A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector, On the linear extension complexity of regular \(n\)-gons, Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs, Lower bounds on nonnegative rank via nonnegative nuclear norms, Lower bounds on matrix factorization ranks via noncommutative polynomial optimization, Fixed points of the EM algorithm and nonnegative rank boundaries
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Common information and unique disjointness
- On the computational complexity of membership problems for the completely positive cone and its dual
- Lower bounds on nonnegative rank via nonnegative nuclear norms
- Positive semidefinite rank
- Positive definite completions of partial Hermitian matrices
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Lectures on algebraic statistics
- Regularizing the abstract convex program
- Expressing combinatorial optimization problems by linear programs
- On the ratio of optimal integral and fractional covers
- On the geometric interpretation of the nonnegative rank
- Combinatorial bounds on nonnegative rank and extended formulations
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- On the fractional intersection number of a graph
- Symmetry groups, semidefinite programs, and sums of squares
- The convex geometry of linear inverse problems
- Fixed points of the EM algorithm and nonnegative rank boundaries
- Tensors of nonnegative rank two
- On maximum, typical and generic ranks
- Gaussian elimination is not optimal
- On multiplication of 2 \(\times\) 2 matrices
- Invariant Semidefinite Programs
- On the cp-Rank and Minimal cp Factorizations of a Completely Positive Matrix
- Stochastic factorizations, sandwiched simplices and the topology of the space of explanations
- Perturbation of Matrices and Nonnegative Rank with a View toward Statistical Models
- Lower Bounds in Communication Complexity
- Approximation Limits of Linear Programs (Beyond Hierarchies)
- On the Complexity of Nonnegative Matrix Factorization
- Sums of even powers of real linear forms
- The common information of two dependent random variables
- Decomposable Tensors as a Quadratic Variety
- On the hardness of approximating minimization problems
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- The Matching Polytope has Exponential Extension Complexity
- Fractional Covers and Communication Complexity
- Semidefinite Programming
- Semidefinite Optimization and Convex Algebraic Geometry
- Lifts of Convex Sets and Cone Factorizations
- Symmetric Tensors and Symmetric Tensor Rank
- Finding Approximately Rank-One Submatrices with the Nuclear Norm and $\ell_1$-Norm
- An information complexity approach to extended formulations
