Normalized Iterative Hard Thresholding for Matrix Completion

No abstract is available for this paper.

• Publication year

  2013

• Venue

  SIAM Journal on Scientific Computing

• Publication date

  2013-10-28

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1137/120876459
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fast Singular Value Thresholding without Singular Value Decomposition

  2013influential reference
• Compressed Sensing

  2012cited by this paper
• Matrix Recipes for Hard Thresholding Methods

  2012cited by this paper
• Low-Rank Matrix Completion by Riemannian Optimization

  2012influential reference
• MATRIX ALPS: Accelerated low rank and sparse matrix reconstruction

  2012cited by this paper
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm

  2012influential reference
• Null space conditions and thresholds for rank minimization

  2011cited by this paper
• Hard Thresholding Pursuit: An Algorithm for Compressive Sensing

  2011cited by this paper
• Numerical algorithms for low-rank matrix completion problems

  2011cited by this paper
• Linear Regression under Fixed-Rank Constraints: A Riemannian Approach

  2011influential reference
• Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion

  2010cited by this paper
• The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices

  2010cited by this paper
• Precise Undersampling Theorems

  2010cited by this paper
• A Riemannian Optimization Approach for Computing Low-Rank Solutions of Lyapunov Equations

  2010influential reference
• Compressed Sensing: How Sharp Is the Restricted Isometry Property?

  2010cited by this paper
• Online Learning in The Manifold of Low-Rank Matrices

  2010influential reference
• Normalized Iterative Hard Thresholding: Guaranteed Stability and Performance

  2010influential reference
• Fixed point and Bregman iterative methods for matrix rank minimization

  2009influential reference
• Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing

  2009cited by this paper
• The Power of Convex Relaxation: Near-Optimal Matrix Completion

  2009influential reference
• Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization

  2009influential reference
• Guaranteed Rank Minimization via Singular Value Projection

  2009influential reference
• Rank-Constrained Solutions to Linear Matrix Equations Using PowerFactorization

  2009influential reference
• ADMiRA: Atomic Decomposition for Minimum Rank Approximation

  2009cited by this paper
• An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems

  2009influential reference
• Matrix completion from a few entries

  2009influential reference
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images

  2009cited by this paper
• An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems

  2009influential reference
• A Singular Value Thresholding Algorithm for Matrix Completion

  2008influential reference
• Alternating Projections on Manifolds

  2008cited by this paper
• Exact Matrix Completion via Convex Optimization

  2008influential reference
• Compressed sensing and best k-term approximation

  2008cited by this paper
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

  2008influential reference
• Iterative Hard Thresholding for Compressed Sensing

  2008cited by this paper
• Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity

  2008influential reference
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

  2007influential reference
• The complexity of matrix completion

  2006influential reference
• Decoding by linear programming

  2005cited by this paper
• Stable signal recovery from incomplete and inaccurate measurements

  2005cited by this paper
• Neighborly Polytopes And Sparse Solution Of Underdetermined Linear Equations

  2005cited by this paper
• Compressive Sampling

  year unknowncited by this paper
• Presented by?????

  year unknowncited by this paper

• Fast and Provable Nonconvex Robust Matrix Completion

  2026influential citation
• Decentralized Nonconvex Low-rank Matrix Recovery

  2025cites this paper
• Scalable Hessian-free Proximal Conjugate Gradient Method for Nonconvex and Nonsmooth Optimization

  2025cites this paper
• Compressed Newton-direction-based Thresholding Methods for Sparse Optimization Problems

  2025cites this paper
• Fast Non-convex Matrix Sensing with Optimal Sample Complexity

  2025cites this paper
• Chain-linked Multiple Matrix Integration via Embedding Alignment

  2025cites this paper
• Confined Orthogonal Matching Pursuit for Sparse Random Combinatorial Matrices

  2025cites this paper
• On Information Geometry and Iterative Optimization in Model Compression: Operator Factorization

  2025cites this paper
• Negative Binomial Matrix Completion

  2024cites this paper
• From theoretical guarantee to practical performance: selectable and optimal step-lengths for IHT and HTP algorithms in compressed sensing

  2024cites this paper
• Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization

  2024cites this paper
• Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions

  2024cites this paper
• Empirical Bayes Poisson matrix completion

  2024cites this paper
• Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms

  2024influential citation
• Sufficient condition based on nearly optimal order RIC for IHT algorithm

  2024cites this paper
• A Preconditioned Riemannian Gradient Descent Algorithm for Low-Rank Matrix Recovery

  2023influential citation
• Laterally constrained low-rank seismic data completion via cyclic-shear transform

  2023cites this paper
• Nonconvex ADMM for Rank-Constrained Matrix Sensing Problem

  2023influential citation
• A Pseudo-Inverse-Based Hard Thresholding Algorithm for Sparse Signal Recovery

  2023cites this paper
• Adaptive Rank-One Matrix Completion Using Sum of Outer Products

  2023influential citation
• Robust Matrix Completion for Elliptic Positioning in the Presence of Outliers and Missing Data

  2023cites this paper
• Comparison of Common Algorithms for Single-Pixel Imaging via Compressed Sensing

  2023cites this paper
• Fast and robust rank-one matrix completion via maximum correntropy criterion and half-quadratic optimization

  2022cites this paper
• Low-rank optimization methods based on projected-projected gradient descent that accumulate at Bouligand stationary points

  2022influential citation
• Alternating Projection Based Unitary Matrix Completion Method for DOA Estimation in Nonuniform Noise

  2022cites this paper
• Fast Gradient Method for Low-Rank Matrix Estimation

  2022influential citation
• Stochastic Variance Reduced Gradient for affine rank minimization problem

  2022cites this paper
• Quantum State Tomography via Nonconvex Riemannian Gradient Descent.

  2022cites this paper
• Variational Bayesian Inference for CP Tensor Completion with Subspace Information

  2022cites this paper
• An interpretable bi-branch neural network for matrix completion

  2022cites this paper
• On Local Linear Convergence Rate of Iterative Hard Thresholding for Matrix Completion

  2021cites this paper
• Hybrid Matrix Completion Model for improved Images Recovery and Recommendation Systems

  2021cites this paper
• Multi-source Learning via Completion of Block-wise Overlapping Noisy Matrices

  2021cites this paper
• Tensor train completion: Local recovery guarantees via Riemannian optimization

  2021cites this paper
• Modewise Operators, the Tensor Restricted Isometry Property, and Low-Rank Tensor Recovery

  2021cites this paper
• Nonlinear matrix recovery using optimization on the Grassmann manifold

  2021cites this paper
• Low-Rank Approximation Algorithms for Matrix Completion with Random Sampling

  2021cites this paper
• Asymptotic Log-Det Rank Minimization via (Alternating) Iteratively Reweighted Least Squares

  2021cites this paper
• GNMR: A provable one-line algorithm for low rank matrix recovery

  2021cites this paper
• BELT: Block-wise Missing Embedding Learning Transformer

  2021cites this paper
• A Scalable Second Order Method for Ill-Conditioned Matrix Completion from Few Samples

  2021influential citation
• BELT: Blockwise Missing Embedding Learning Transfomer

  2021cites this paper
• Newton-Type Optimal Thresholding Algorithms for Sparse Optimization Problems

  2021cites this paper
• Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descent

  2021cites this paper
• Unlabeled Principal Component Analysis

  2021cites this paper
• On Local Convergence of Iterative Hard Thresholding for Matrix Completion

  2021cites this paper
• Over-Parametrized Matrix Factorization in the Presence of Spurious Stationary Points

  2021cites this paper
• Provable Near-Optimal Low-Multilinear-Rank Tensor Recovery

  2020cites this paper
• Escaping Saddle Points in Ill-Conditioned Matrix Completion with a Scalable Second Order Method

  2020influential citation
• Positive Semidefinite Matrix Factorization: A Connection With Phase Retrieval and Affine Rank Minimization

  2020cites this paper
• Class-Specific Blind Deconvolutional Phase Retrieval Under a Generative Prior

  2020cites this paper
• Compressed sensing of low-rank plus sparse matrices

  2020influential citation
• Rank 2r Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries

  2020influential citation
• Fast Exact Matrix Completion: A Unified Optimization Framework

  2020cites this paper
• Robust Inexact Alternating Optimization for Matrix Completion with Outliers

  2020cites this paper
• Low-Rank Matrix Completion Using Graph Neural Network

  2020cites this paper
• Turbo-Type Algorithm for Affine Rank Minimization

  2020cites this paper
• An exact sinΘ formula for matrix perturbation analysis and its applications

  2020cites this paper
• Robust Matrix Completion via ℓP-Greedy Pursuits

  2020cites this paper
• Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-order Convergence

  2020cites this paper
• Turbo Message Passing Algorithms for Structured Signal Recovery

  2020influential citation
• Low-Rank Matrix Completion: A Contemporary Survey

  2019cites this paper
• Phaseless PCA: Low-Rank Matrix Recovery from Column-wise Phaseless Measurements

  2019cites this paper
• Matrix rigidity and the ill-posedness of 1 Robust PCA and matrix completion

  2019cites this paper
• A Review of Sparse Recovery Algorithms

  2019cites this paper
• Robust Matrix Completion via Maximum Correntropy Criterion and Half-Quadratic Optimization

  2019cites this paper
• Graph and Rank Regularized Matrix Recovery for Snapshot Spectral Image Demosaicing

  2019cites this paper
• Regularized sample average approximation for high-dimensional stochastic optimization under low-rankness

  2019cites this paper
• Robust M-estimation Based Matrix Completion

  2019cites this paper
• Low rank tensor decompositions for high dimensional data approximation, recovery and prediction

  2019cites this paper
• Homotopy method for matrix rank minimization based on the matrix hard thresholding method

  2019cites this paper
• Accelerating Iterative Hard Thresholding for Low-rank Matrix Completion via Adaptive Restart

  2019cites this paper
• Simultaneous Blind Deconvolution and Phase Retrieval with Tensor Iterative Hard Thresholding

  2019cites this paper
• Local Convergence of the Heavy Ball Method in Iterative Hard Thresholding for Low-rank Matrix Completion

  2019cites this paper
• One-Bit Compressive Sensing With Projected Subgradient Method Under Sparsity Constraints

  2019cites this paper
• Matrix completion via minimizing an approximate rank

  2019cites this paper
• Iterative hard thresholding for low CP-rank tensor models

  2019cites this paper
• A Novel Demodulation Analysis Technique for Bearing Fault Diagnosis via Energy Separation and Local Low-Rank Matrix Approximation

  2019cites this paper
• Stochastic Iterative Hard Thresholding for Low-Tucker-Rank Tensor Recovery

  2019cites this paper
• Learned Turbo Message Passing for Affine Rank Minimization and Compressed Robust Principal Component Analysis

  2019influential citation
• An Effective Bearing Fault Diagnosis Technique via Local Robust Principal Component Analysis and Multi-Scale Permutation Entropy

  2019cites this paper
• A generalized Douglas-Rachford splitting algorithm for nonconvex optimization

  2019cites this paper
• Fast Exact Matrix Completion: A Unifying Optimization Framework

  2019cites this paper
• Learned Turbo-type Affine Rank Minimization

  2019cites this paper
• Channel Estimation Method and Phase Shift Design for Reconfigurable Intelligent Surface Assisted MIMO Networks

  2019influential citation
• Provable Low Rank Phase Retrieval

  2019cites this paper
• Iterative hard thresholding for low-rank recovery from rank-one projections

  2018cites this paper
• Low-Rank Methods in Event Detection

  2018cites this paper
• Accelerated Gradient and Block-Wise Gradient Methods for Big Data Factorization

  2018cites this paper
• Robust Low-Rank Approximation of Matrices in lp-Space

  2018influential citation
• Two-stage Method for the Reconstruction of a Low-Rank Matrix

  2018influential citation
• Low rank tensor decomposition for feature extraction and tensor recovery

  2018influential citation
• TARM: A Turbo-Type Algorithm for Affine Rank Minimization

  2018influential citation
• Interpretable Matrix Completion: A Discrete Optimization Approach

  2018cites this paper
• Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview

  2018cites this paper
• Tarm: A Turbo-Type Algorithm for Low-Rank Matrix Recovery

  2018cites this paper
• Exploiting the structure effectively and efficiently in low rank matrix recovery

  2018cites this paper
• Matrix Recovery from Rank-One Projection Measurements via Nonconvex Minimization

  2018cites this paper
• Rank-One Matrix Completion With Automatic Rank Estimation via L1-Norm Regularization

  2018influential citation
• Matrix rigidity and the ill-posedness of Robust PCA and matrix completion

  2018cites this paper