Models and algorithms for low-rank and sparse matrix optimization problems

DOI10.15960/J.CNKI.ISSN.1007-6093.2020.03.001MaRDI QIDQ4986045zbMATH OpenFDO

Authors Shaohua Pan, Zaiwen Wen

Publication date 26 April 2021

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2020.03.001

zbMATH Keywords

convergenceconvex relaxation modelsexact recovery conditionsfactorization modelslow-rank and sparse matrix optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Recommendations

• Some advances in low-rank matrix optimization
• Preface
• Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems
• Rank-Sparsity Incoherence for Matrix Decomposition
• The non-convex geometry of low-rank matrix optimization

Cited in

(7)

• Low-rank and sparse matrices fitting algorithm for low-rank representation
• Optimization challenges in the structured low rank approximation problem
• Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems
• Some advances in low-rank matrix optimization
• Preface
• Spurious Valleys, NP-Hardness, and Tractability of Sparse Matrix Factorization with Fixed Support
• Exterior-point optimization for sparse and low-rank optimization

This page was built for publication: Models and algorithms for low-rank and sparse matrix optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4986045)