Normalized Iterative Hard Thresholding for Matrix Completion
From MaRDI portal
Publication:2870672
DOI10.1137/120876459zbMath1282.65043OpenAlexW2000345836MaRDI QIDQ2870672
Publication date: 21 January 2014
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9b785002627fd2066fce004199758ce137a1ce61
Inverse problems in linear algebra (15A29) Iterative numerical methods for linear systems (65F10) Approximation with constraints (41A29) Matrix completion problems (15A83)
Related Items
Streaming Principal Component Analysis From Incomplete Data, Tensor Completion in Hierarchical Tensor Representations, Guarantees of Riemannian optimization for low rank matrix completion, GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery, Newton-type optimal thresholding algorithms for sparse optimization problems, Iterative hard thresholding for low CP-rank tensor models, Iterative hard thresholding for low-rank recovery from rank-one projections, Fast gradient method for low-rank matrix estimation, Regularized sample average approximation for high-dimensional stochastic optimization under low-rankness, Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery, Compressed sensing of low-rank plus sparse matrices, CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, Low rank matrix completion by alternating steepest descent methods, Stable low-rank matrix recovery via null space properties, Painless breakups -- efficient demixing of low rank matrices, Iterative hard thresholding methods for \(l_0\) regularized convex cone programming, Minimax risk of matrix denoising by singular value thresholding, Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations, Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion, Matrix completion under interval uncertainty, Matrix recipes for hard thresholding methods, Low-Rank Tensor Recovery using Sequentially Optimal Modal Projections in Iterative Hard Thresholding (SeMPIHT), Homotopy method for matrix rank minimization based on the matrix hard thresholding method, Unnamed Item, Low-rank approximation algorithms for matrix completion with random sampling, Guarantees of Riemannian Optimization for Low Rank Matrix Recovery, Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably, Matrix completion via minimizing an approximate rank, Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries, Unnamed Item, A non-convex algorithm framework based on DC programming and DCA for matrix completion, Nonlinear matrix recovery using optimization on the Grassmann manifold, Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion
Uses Software
