Cited in
(45)- Guarantees of Riemannian optimization for low rank matrix completion
- Exact minimum rank approximation via Schatten p-norm minimization
- Enhancing matrix completion using a modified second-order total variation
- An adaptation for iterative structured matrix completion
- Low-rank matrix completion via preconditioned optimization on the Grassmann manifold
- Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
- A non-convex algorithm framework based on DC programming and DCA for matrix completion
- Guarantees of Riemannian optimization for low rank matrix recovery
- Learning non-parametric basis independent models from point queries via low-rank methods
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm
- Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
- Matrix completion under interval uncertainty
- Minimum n-rank approximation via iterative hard thresholding
- Stable low-rank matrix recovery via null space properties
- Uniqueness conditions for low-rank matrix recovery
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Convergence of projected Landweber iteration for matrix rank minimization
- Fixed-rank matrix factorizations and Riemannian low-rank optimization
- PROPACK
- CoSaMP
- LMaFit
- Eigentaste
- softImpute
- Jellyfish
- Optspace
- GenRTR
- RTRMC
- PhaseLift
- Wirtinger Flow
- BranchHull
- Matrix rigidity and the ill-posedness of robust PCA and matrix completion
- Low rank matrix recovery from rank one measurements
- Low-rank dynamic mode decomposition: an exact and tractable solution
- Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
- Orthogonal rank-one matrix pursuit for low rank matrix completion
- Matrix recipes for hard thresholding methods
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
- An alternating minimization method for matrix completion problems
- A penalty decomposition method for rank minimization problem with affine constraints
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
- Rank-constrained optimization and its applications
This page was built for software: ADMiRA
