An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion

DOI10.1016/J.NEUNET.2013.06.013zbMath1297.65048OpenAlexW1977016492WikidataQ45958866 ScholiaQ45958866MaRDI QIDQ460667

J. Herrera, D. Rodríguez-Gómez

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

zbMATH Keywords

matrix completionrank minimizationlow rank representationlow-rank and sparse matrix decompositiontrace norm minimization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (6)

Alternating direction method of multipliers for generalized low-rank tensor recovery ⋮ Robust bilinear factorization with missing and grossly corrupted observations ⋮ Online subspace learning and imputation by tensor-ring decomposition ⋮ Recovering low-rank and sparse matrix based on the truncated nuclear norm ⋮ Sparse subspace clustering for data with missing entries and high-rank matrix completion ⋮ Similarity preserving low-rank representation for enhanced data representation and effective subspace learning

Uses Software

• PROPACK
• Yall1
• LMaFit
• RASL

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• 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
• Fixed point and Bregman iterative methods for matrix rank minimization
• Learning a common substructure of multiple graphical Gaussian models
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Exact matrix completion via convex optimization
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• Matrix completion via an alternating direction method
• A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration
• Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Bayesian Robust Principal Component Analysis
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Robust Recovery of Signals From a Structured Union of Subspaces
• Learning the parts of objects by non-negative matrix factorization
• Real-Time Discriminative Background Subtraction
• Projected Gradient Methods for Nonnegative Matrix Factorization
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization

This page was built for publication: An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion