A generalized nonconvex algorithm framework for low-rank and sparse matrix decomposition

The low-rank and sparse matrix decomposition problem is a hot and challenging problem in computer science. In this paper, we consider it as a nonconvex relaxation optimization problem by using a family of nonconvex functions to approximate the rank function and the -norm in low-rank and sparse matri...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Applied intelligence (Dordrecht, Netherlands) Ročník 55; číslo 16; s. 1085
Hlavní autori:	Cui, Angang, Zhang, Lijun, He, Haizhen, Xue, Shengli
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.11.2025 Springer Nature B.V
Predmet:	Adaptive algorithms Algorithms Approximation Artificial Intelligence Computer Science Decomposition Machines Manufacturing Mechanical Engineering Optimization Parameters Processes Regularization Sparse matrices Sparsity Nonconvex algorithm framework Nonconvex function regularization Reneralized low-rank and sparse matrix decomposition problem Low-rank and sparse matrix decomposition
ISSN:	0924-669X, 1573-7497
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!