scientific article; zbMATH DE number 7164702
From MaRDI portal
Publication:5214187
zbMath1440.15021MaRDI QIDQ5214187
Hongyang Zhang, Yingyu Liang, Zhao Song, Maria-Florina Balcan, David P. Woodruff
Publication date: 7 February 2020
Full work available at URL: http://jmlr.csail.mit.edu/papers/v20/17-611.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
matrix completionnon-convex optimizationstrong dualitymatrix factorizationrobust principal component analysissample complexity
Factor analysis and principal components; correspondence analysis (62H25) Factorization of matrices (15A23) Nonconvex programming, global optimization (90C26) Numerical linear algebra (65F99) Matrix completion problems (15A83)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple bounds for recovering low-complexity models
- Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
- The convex geometry of linear inverse problems
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Low-rank models in visual analysis
- Exact matrix completion via convex optimization
- Sparse Modeling for Image and Vision Processing
- Estimation in High Dimensions: A Geometric Perspective
- Generalized Low Rank Models
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Tensor decompositions for learning latent variable models
- Guaranteed Matrix Completion via Non-Convex Factorization
- Completing Low-Rank Matrices With Corrupted Samples From Few Coefficients in General Basis
- Incoherence-Optimal Matrix Completion
- Blind Deconvolution Using Convex Programming
- Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
- Robust principal component analysis?
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
- Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
- Rank-Sparsity Incoherence for Matrix Decomposition
- Relations between average case complexity and approximation complexity
- On the Sum of the Largest Eigenvalues of a Symmetric Matrix
- Low-Rank Optimization With Convex Constraints
- Low rank approximation with entrywise l 1 -norm error
- Finding approximate local minima faster than gradient descent
- On Nonconvex Optimization for Machine Learning
- Testing Matrix Rank, Optimally
- Relative Error Tensor Low Rank Approximation
- Smoothed analysis of tensor decompositions
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Matrix Completion From a Few Entries
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Compressed Sensing Off the Grid
- Weighted low rank approximations with provable guarantees
- Relations Among Some Low-Rank Subspace Recovery Models
- A Simpler Approach to Matrix Completion
- Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
- Computing a nonnegative matrix factorization -- provably
- Learning Theory
- Low-rank matrix completion using alternating minimization
- Algorithms and Computation
- An Almost Optimal Algorithm for Computing Nonnegative Rank
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
