Low-rank and sparse matrices fitting algorithm for low-rank representation

DOI10.1016/j.camwa.2019.07.012zbMath1460.68097OpenAlexW2965397241MaRDI QIDQ2004500

Jianxi Zhao, Li-Na Zhao

Publication date: 7 October 2020

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2019.07.012

zbMATH Keywords

Newton methodlow-rank representationalternating direction minimizationlinear search methodlow-rank subspace

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Pattern recognition, speech recognition (68T10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Uses Software

• LMaFit

Cites Work

• Unnamed Item
• Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
• Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations
• Minimization of functions having Lipschitz continuous first partial derivatives
• On Newton's method
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• A Nonmonotone Line Search Technique for Newton’s Method
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization