Handbook of Robust Low-Rank and Sparse Matrix Decomposition

DOI10.1201/b20190zbMath1339.68002OpenAlexW2503308866MaRDI QIDQ2797116

No author found.

Publication date: 4 April 2016

Full work available at URL: https://doi.org/10.1201/b20190

Mathematics Subject Classification ID

Related Items (16)

Correcting noisy dynamic mode decomposition with Kalman filters ⋮ Golden Ratio Primal-Dual Algorithm with Linesearch ⋮ A generalized inexact Uzawa method for stable principal component pursuit problem with nonnegative constraints ⋮ CMD: controllable matrix decomposition with global optimization for deep neural network compression ⋮ A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming ⋮ Compressive total variation for image reconstruction and restoration ⋮ Robust principal component analysis using facial reduction ⋮ Convergent prediction-correction-based ADMM for multi-block separable convex programming ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset ⋮ A golden ratio primal-dual algorithm for structured convex optimization ⋮ Sparse Principal Component Analysis via Variable Projection ⋮ Impossibility of dimension reduction in the nuclear norm ⋮ Moving objects detection with a moving camera: a comprehensive review ⋮ A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm ⋮ GRPDA revisited: relaxed condition and connection to Chambolle-Pock's primal-dual algorithm ⋮ An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems

This page was built for publication: Handbook of Robust Low-Rank and Sparse Matrix Decomposition