ADMiRA: Atomic Decomposition for Minimum Rank Approximation
From MaRDI portal
Publication:5281301
DOI10.1109/TIT.2010.2054251zbMath1366.94112arXiv0905.0044MaRDI QIDQ5281301
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.0044
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
94A08: Image processing (compression, reconstruction, etc.) in information and communication theory
15A83: Matrix completion problems
Related Items
CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, Stable low-rank matrix recovery via null space properties, Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion, ADMiRA, Minimum \( n\)-rank approximation via iterative hard thresholding, Low rank matrix recovery from rank one measurements, Exact minimum rank approximation via Schatten \(p\)-norm minimization, Uniqueness conditions for low-rank matrix recovery, Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset, Convergence of fixed-point continuation algorithms for matrix rank minimization, Learning non-parametric basis independent models from point queries via low-rank methods, Enhancing matrix completion using a modified second-order total variation, Matrix completion under interval uncertainty, Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm, Matrix recipes for hard thresholding methods, Convergence of projected Landweber iteration for matrix rank minimization, Fixed-rank matrix factorizations and Riemannian low-rank optimization, A non-convex algorithm framework based on DC programming and DCA for matrix completion, Low-rank matrix completion via preconditioned optimization on the Grassmann manifold, Rank-constrained optimization and its applications, Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery, Guarantees of Riemannian Optimization for Low Rank Matrix Recovery, Penalty decomposition methods for rank minimization
Uses Software
