Suppr超能文献

用于秩最小化的矩阵神经动力学方法:有限/固定时间收敛技术

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

作者信息

Zhang Meng, He Xing, Huang Tingwen

出版信息

IEEE Trans Neural Netw Learn Syst. 2025 Jul;36(7):12747-12757. doi: 10.1109/TNNLS.2024.3454383.

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.

摘要

本文提出了两种创新的矩阵神经动力学方法(MNA),旨在解决秩最小化问题。首先,通过引入矩阵范数归一化符号函数,开发了MNA的两种变体:有限时间收敛MNA(FINt-MNA)和固定时间收敛MNA(FIXt-MNA)。然后,所提出的方法被证明能保证解的存在性和唯一性,并且基于李雅普诺夫分析表明,所提出的方法在FINt和FIXt内收敛到最优解。此外,使用有限时间和固定时间引理确定了调节时间的上限,随后的分析通过控制变量法研究了可调参数对这两种方法的这些上限的影响。最后,数值例子和图像完成实验证实了所提出的方法与现有MNA和两种经典方法相比的有效性和优越性。

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验