Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization

DOI10.1007/s11263-014-0746-0zbMath1398.68463arXiv1309.1539OpenAlexW3105455086MaRDI QIDQ1799934

Yanyan Li

Publication date: 19 October 2018

Published in: International Journal of Computer Vision (Search for Journal in Brave)

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

zbMATH Keywords

non-convex optimizationphotometric stereolow rank matrix completionrobust matrix factorizationSFM

Mathematics Subject Classification ID

Image analysis in multivariate analysis (62H35) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Matrix completion problems (15A83)

Related Items (4)

Low-rank and sparse matrix recovery via inexact Newton-like method with non-monotone search ⋮ Unnamed Item ⋮ Majorized proximal alternating imputation for regularized rank constrained matrix completion ⋮ A Single-Lobe Photometric Stereo Approach for Heterogeneous Material

Uses Software

• CVX
• TFOCS
• HOGWILD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A feasible method for optimization with orthogonality constraints
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• On the Wiberg algorithm for matrix factorization in the presence of missing components
• Templates for convex cone problems with applications to sparse signal recovery
• Compressed sensing and matrix completion with constant proportion of corruptions
• Exact matrix completion via convex optimization
• A Proximal Point Algorithm for Log-Determinant Optimization with Group Lasso Regularization
• Robust principal component analysis?
• Graph Implementations for Nonsmooth Convex Programs
• Rank-Sparsity Incoherence for Matrix Decomposition
• Hessian Matrix vs. Gauss–Newton Hessian Matrix
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• On the Moreau--Yosida Regularization of the Vector $k$-Norm Related Functions
• Lower Rank Approximation of Matrices by Least Squares with Any Choice of Weights
• De-noising by soft-thresholding
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• A Simpler Approach to Matrix Completion
• Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
• Low-rank matrix completion using alternating minimization

This page was built for publication: Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization