Low-rank and sparse matrix recovery via inexact Newton-like method with non-monotone search

DOI10.1016/j.aml.2020.106357zbMath1503.90101OpenAlexW3015045850MaRDI QIDQ2178693

Qian-Ying Shen, Qingqing Sun, Chuan-Long Wang

Publication date: 11 May 2020

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2020.106357

zbMATH Keywords

Newton-like methodnon-convexlow-rank and sparse matrix recoverynon-monotone search

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical linear algebra (65F99)

Cites Work

• Unnamed Item
• Convergence analysis of the augmented Lagrange multiplier algorithm for a class of matrix compressive recovery
• Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization
• Robust principal component analysis?
• Accelerated Alternating Projections for Robust Principal Component Analysis

This page was built for publication: Low-rank and sparse matrix recovery via inexact Newton-like method with non-monotone search