Binary Component Decomposition Part I: The Positive-Semidefinite Case
From MaRDI portal
Publication:4999392
DOI10.1137/19M1278612OpenAlexW3157919831MaRDI QIDQ4999392
Publication date: 6 July 2021
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.13603
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27) Numerical linear algebra (65Fxx)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- User-friendly tail bounds for sums of random matrices
- Quick approximation to matrices and applications
- Geometric algorithms and combinatorial optimization.
- Independent component analysis, a new concept?
- Nonlinear methods of approximation
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Multivariate approximation in total variation. I: Equilibrium distributions of Markov jump processes
- Principal component analysis.
- On a positive semidefinite relaxation of the cut polytope
- Some remarks on greedy algorithms
- Simplicial faces of the set of correlation matrices
- Integer Factorization of a Positive-Definite Matrix
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Probabilistic Principal Component Analysis
- Sparse Activity Detection for Massive Connectivity
- Massive Connectivity With Massive MIMO—Part I: Device Activity Detection and Channel Estimation
- On the Facial Structure of the Set of Correlation Matrices
- On the Complexity of Robust PCA and ℓ1-Norm Low-Rank Matrix Approximation
- Convex and Discrete Geometry
- Convex Bodies The Brunn-MinkowskiTheory
- Approximating the Cut-Norm via Grothendieck's Inequality
- Convex Analysis
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Geometry of cuts and metrics
