scientific article; zbMATH DE number 6276219

Publication date: 1 April 2014

Full work available at URL: http://www.jmlr.org/papers/v13/mohan12a.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

matrix completion iterative algorithms matrix rank minimization null-space property

Vector spaces, linear dependence, rank, lineability (15A03) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Related Items

Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery ⋮ A penalty method for rank minimization problems in symmetric matrices ⋮ Low-rank matrix recovery with Ky Fan 2-$k$-norm ⋮ Orientation estimation of cryo-EM images using projected gradient descent method ⋮ $S_{1/2}$ regularization methods and fixed point algorithms for affine rank minimization problems ⋮ A rank-corrected procedure for matrix completion with fixed basis coefficients ⋮ Global optimality condition and fixed point continuation algorithm for non-Lipschitz $\ell_p$ regularized matrix minimization ⋮ Optimization Methods for Synthetic Aperture Radar Imaging ⋮ A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems ⋮ Trading off $1$-norm and sparsity against rank for linear models using mathematical optimization: $1$-norm minimizing partially reflexive ah-symmetric generalized inverses ⋮ Rank-constrained optimization and its applications ⋮ Maximum entropy vector kernels for MIMO system identification ⋮ Image restoration: structured low rank matrix framework for piecewise smooth functions and beyond ⋮ A globally convergent algorithm for nonconvex optimization based on block coordinate update ⋮ Unsupervised robust discriminative manifold embedding with self-expressiveness ⋮ A universal rank approximation method for matrix completion ⋮ Exact minimum rank approximation via Schatten $p$-norm minimization ⋮ Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint ⋮ Convex envelopes for fixed rank approximation ⋮ A singular value $p$-shrinkage thresholding algorithm for low rank matrix recovery ⋮ Matrix completion with column outliers and sparse noise ⋮ 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 ⋮ Miscellaneous reverse order laws for generalized inverses of matrix products with applications ⋮ Weighted nuclear norm minimization and its applications to low level vision ⋮ Matrix completion with nonconvex regularization: spectral operators and scalable algorithms ⋮ An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems ⋮ PCA Sparsified ⋮ Matrix completion for matrices with low-rank displacement ⋮ Calmness of partial perturbation to composite rank constraint systems and its applications ⋮ Sparse Solutions in Optimal Control of PDEs with Uncertain Parameters: The Linear Case ⋮ A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery ⋮ Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization ⋮ Optimal rank-sparsity decomposition ⋮ Several Classes of Stationary Points for Rank Regularized Minimization Problems ⋮ Krylov Methods for Low-Rank Regularization ⋮ Sparse and nonnegative sparse D-MORPH regression ⋮ Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery ⋮ Equivalent Lipschitz surrogates for zero-norm and rank optimization problems ⋮ Homotopy method for matrix rank minimization based on the matrix hard thresholding method ⋮ Unnamed Item ⋮ Iterative re-weighted least squares algorithm for $l_p$-minimization with tight frame and $0 < p \leq 1$ ⋮ Error bounds for rank constrained optimization problems and applications ⋮ A non-convex tensor rank approximation for tensor completion ⋮ Low-rank factorization for rank minimization with nonconvex regularizers ⋮ Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers ⋮ 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 ⋮ Tensor Methods for Nonlinear Matrix Completion ⋮ Spectrum estimation with missing values: A regularized nuclear norm minimization approach ⋮ Weighted lp − l1 minimization methods for block sparse recovery and rank minimization ⋮ Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization ⋮ Recovery of Surfaces and Functions in High Dimensions: Sampling Theory and Links to Neural Networks ⋮ A mean value algorithm for Toeplitz matrix completion ⋮ Nonlinear matrix recovery using optimization on the Grassmann manifold