ADMiRA

swMATH31664MaRDI QIDQ43375FDOQ43375

Author name not available (Why is that?)

Described by source

• ADMiRA: Atomic Decomposition for Minimum Rank Approximation
• Corrections to “ADMiRA: Atomic Decomposition for Minimum Rank Approximation” [Sep 10 4402-4416]

Cited In (33)

• Enhancing matrix completion using a modified second-order total variation
• Exact minimum rank approximation via Schatten \(p\)-norm minimization
• 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
• Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion
• 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
• Matrix completion under interval uncertainty
• Stable low-rank matrix recovery via null space properties
• Minimum \( n\)-rank approximation via iterative hard thresholding
• Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
• 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
• Low-rank dynamic mode decomposition: an exact and tractable solution
• Low rank matrix recovery from rank one measurements
• Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
• 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
• Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably
• Rank-constrained optimization and its applications
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
• Guarantees of Riemannian optimization for low rank matrix completion

This page was built for software: ADMiRA