Matrix Neurodynamic Approaches for Rank Minimization: Finite/Fixed-Time Convergence Technique

This article presents two innovative matrix neurodynamic approaches (MNAs) designed to tackle the rank minimization problem. First, by introducing the matrix norm-normalized sign function, two variants of MNA are developed: finite-time converging MNA (FINt-MNA) and fixed-time converging MNA (FIXt-MNA). Then, the proposed approaches are shown to guarantee the existence and uniqueness of solutions, and based on Lyapunov analysis, it is demonstrated that the proposed approaches converge to the optimal solution within FINt and FIXt. In addition, upper bounds on the settling time are determined using finite-time and fixed-time lemmas, with subsequent analysis examining the influence of tunable parameters on these bounds for the two approaches through the control variable method. Finally, numerical examples and an image completion experiment confirm the effectiveness and superiority of the proposed approaches compared with the existing MNA and two classical approaches.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Neural Networks and Learning Systems
Published
2024-09-16
DOI
https://doi.org/10.1109/tnnls.2024.3454383
Citations
1
Primary Topic
Magnetic Bearings and Levitation Dynamics
Type
article
Field-Weighted Citation Impact
0.33

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Matrix Neurodynamic Approaches for Rank Minimization: Finite/Fixed-Time Convergence Technique

Xing He, Tingwen Huang, Meng Zhang
1 citations
IEEE Transactions on Neural Networks and Learning Systems
Magnetic Bearings and Levitation Dynamics
0.33
article

Matrix Neurodynamic Approaches for Rank Minimization: Finite/Fixed-Time Convergence Technique

Xing He, Tingwen Huang, Meng Zhang
article en
1 citations

Abstract

This article presents two innovative matrix neurodynamic approaches (MNAs) designed to tackle the rank minimization problem. First, by introducing the matrix norm-normalized sign function, two variants of MNA are developed: finite-time converging MNA (FINt-MNA) and fixed-time converging MNA (FIXt-MNA). Then, the proposed approaches are shown to guarantee the existence and uniqueness of solutions, and based on Lyapunov analysis, it is demonstrated that the proposed approaches converge to the optimal solution within FINt and FIXt. In addition, upper bounds on the settling time are determined using finite-time and fixed-time lemmas, with subsequent analysis examining the influence of tunable parameters on these bounds for the two approaches through the control variable method. Finally, numerical examples and an image completion experiment confirm the effectiveness and superiority of the proposed approaches compared with the existing MNA and two classical approaches.

IEEE Transactions on Neural Networks and Learning SystemsVol. 36(7)
Southwest University (CN), Shenzhen University (CN), Shenzhen Technology University (CN)
National Natural Science Foundation of China, Natural Science Foundation of Chongqing, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 42%
Magnetic Bearings and Levitation Dynamics
0.33
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.