An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
DOI10.1016/J.NEUNET.2013.06.013zbMATH Open1297.65048OpenAlexW1977016492WikidataQ45958866 ScholiaQ45958866MaRDI QIDQ460667FDOQ460667
Authors: Yuanyuan Liu, Licheng Jiao, Fanhua Shang, Fei Yin, Fang Liu 
Publication date: 14 October 2014
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2013.06.013
Recommendations
- A fast tri-factorization method for low-rank matrix recovery and completion
- An alternating minimization method for matrix completion problems
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Matrix completion via a low rank factorization model and an augmented Lagrangean succesive overrelaxation algorithm
- Low-rank matrix recovery via iteratively reweighted least squares minimization
matrix completionrank minimizationlow rank representationlow-rank and sparse matrix decompositiontrace norm minimization
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Matrix completion from noisy entries
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- Exact matrix completion via convex optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Learning the parts of objects by non-negative matrix factorization
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Matrix completion via an alternating direction method
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Fixed point and Bregman iterative methods for matrix rank minimization
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Bayesian Robust Principal Component Analysis
- Alternating direction method with Gaussian back substitution for separable convex programming
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Robust Recovery of Signals From a Structured Union of Subspaces
- Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
- Graph dual regularization non-negative matrix factorization for co-clustering
- Fast density-weighted low-rank approximation spectral clustering
- A fast tri-factorization method for low-rank matrix recovery and completion
- An efficient matrix factorization based low-rank representation for subspace clustering
- Real-Time Discriminative Background Subtraction
- Learning a common substructure of multiple graphical Gaussian models
Cited In (7)
- Sparse subspace clustering for data with missing entries and high-rank matrix completion
- Alternating direction method of multipliers for generalized low-rank tensor recovery
- Robust bilinear factorization with missing and grossly corrupted observations
- Recovering low-rank and sparse matrix based on the truncated nuclear norm
- A fast tri-factorization method for low-rank matrix recovery and completion
- Similarity preserving low-rank representation for enhanced data representation and effective subspace learning
- Online subspace learning and imputation by tensor-ring decomposition
Uses Software
This page was built for publication: An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q460667)
