Robust bilinear factorization with missing and grossly corrupted observations
type: Item
instance of: scholarly article
title: Robust bilinear factorization with missing and grossly corrupted observations
author: Xianqiang Yang
published in: Information Sciences
publication date: 2018-05-15T00:00:00Z
full work available at URL: https://arxiv.org/abs/1409.1062
Mathematics Subject Classification ID: 62H25
zbMATH DE Number: 6868730
zbMATH Keywords: compressive principal component pursuit
zbMATH Keywords: robust matrix completion
zbMATH Keywords: robust principal component analysis
zbMATH Keywords: low-rank matrix recovery and completion
describes a project that uses: LMaFit
describes a project that uses: softImpute
describes a project that uses: RTRMC
describes a project that uses: RASL
MaRDI profile type: Publication
OpenAlex ID: W1977580401
cites work: Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Local minima and convergence in low-rank semidefinite programming
cites work: A Singular Value Thresholding Algorithm for Matrix Completion
cites work: Robust principal component analysis?
cites work: Exact matrix completion via convex optimization
cites work: Matrix Completion From a Few Entries
cites work: Compressed sensing and matrix completion with constant proportion of corruptions
cites work: Active subspace: toward scalable low-rank learning
cites work: An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
cites work: Decomposition Approach for Low-Rank Matrix Completion and Its Applications
cites work: Fixed point and Bregman iterative methods for matrix rank minimization
cites work: Spectral regularization algorithms for learning large incomplete matrices
cites work: Graph dual regularization non-negative matrix factorization for co-clustering
cites work: Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
cites work: Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
cites work: Q3161693
cites work: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
cites work: Compressive principal component pursuit
cites work: Robust PCA via Outlier Pursuit
cites work: Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
cites work: Click Prediction for Web Image Reranking Using Multimodal Sparse Coding
cites work: Adaptive Hypergraph Learning and its Application in Image Classification
cites work: Q4908856
DOI: 10.1016/J.INS.2015.02.026
description: scientific article; zbMATH DE number 6868730