Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization

From MaRDI portal
Publication:3225244

DOI10.1137/100811404zbMath1236.65044arXiv1010.2471OpenAlexW2077430220MaRDI QIDQ3225244

Massimo Fornasier, Holger Rauhut, Rachel Ward

Publication date: 16 March 2012

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.2471



Related Items

Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery, Orientation estimation of cryo-EM images using projected gradient descent method, Nonlinear residual minimization by iteratively reweighted least squares, A rank-corrected procedure for matrix completion with fixed basis coefficients, Conjugate gradient acceleration of iteratively re-weighted least squares methods, Low rank matrix recovery from rank one measurements, Low rank tensor recovery via iterative hard thresholding, On the Schatten \(p\)-quasi-norm minimization for low-rank matrix recovery, GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery, Maximum entropy vector kernels for MIMO system identification, Image restoration: structured low rank matrix framework for piecewise smooth functions and beyond, Penalty decomposition methods for rank minimization, A relaxed Kačanov iteration for the \(p\)-Poisson problem, A Majorization-Minimization Algorithm for Computing the Karcher Mean of Positive Definite Matrices, Principal component analysis based on nuclear norm minimization, Proximal linearization methods for Schatten \(p\)-quasi-norm minimization, A nonconvex approach to low-rank matrix completion using convex optimization, Proximal iteratively reweighted algorithm for low-rank matrix recovery, Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds, \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization, Matrix completion with nonconvex regularization: spectral operators and scalable algorithms, A two-phase rank-based algorithm for low-rank matrix completion, Low rank matrix minimization with a truncated difference of nuclear norm and Frobenius norm regularization, Stable low-rank matrix recovery via null space properties, Compressive Sensing, Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization, Enhancing matrix completion using a modified second-order total variation, Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization, Nuclear norm based two-dimensional sparse principal component analysis, Krylov Methods for Low-Rank Regularization, Subspace-based spectrum estimation in innovation models by mixed norm minimization, Sparse and nonnegative sparse D-MORPH regression, Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery, Convergence of projected Landweber iteration for matrix rank minimization, A reweighted nuclear norm minimization algorithm for low rank matrix recovery, Unnamed Item, Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\), Norm-minimized scattering data from intensity spectra, Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery, Minimization of the difference of Nuclear and Frobenius norms for noisy low rank matrix recovery, An adaptation for iterative structured matrix completion, Matrix completion via minimizing an approximate rank, Uniform pointwise estimates for ultraspherical polynomials, Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries, Weighted lp − l1 minimization methods for block sparse recovery and rank minimization, Recovery of Surfaces and Functions in High Dimensions: Sampling Theory and Links to Neural Networks, Nonlinear matrix recovery using optimization on the Grassmann manifold, Proof methods for robust low-rank matrix recovery, A smoothing proximal gradient algorithm for matrix rank minimization problem