A New Varying-Parameter Recurrent Neural-Network for Online Solution of Time-Varying Sylvester Equation

被引:155
作者
Zhang, Zhijun [1 ,2 ]
Zheng, Lunan [1 ,2 ]
Weng, Jian [3 ]
Mao, Yijun [4 ]
Lu, Wei [5 ]
Xiao, Lin [6 ]
机构
[1] South China Univ Technol, Sch Automat Sci & Engn, Guangzhou 510640, Guangdong, Peoples R China
[2] Guangzhou Key Lab Brain Comp Interact & Applicat, Guangzhou 510640, Guangdong, Peoples R China
[3] Jinan Univ, Sch Informat Sci & Technol, Guangzhou 510632, Guangdong, Peoples R China
[4] South China Agr Univ, Coll Math & Informat, Guangzhou 510640, Guangdong, Peoples R China
[5] Sun Yat Sen Univ, Sch Data & Comp Sci, Guangzhou 510275, Guangdong, Peoples R China
[6] Jishou Univ, Sch Informat Sci & Engn, Jishou 416000, Peoples R China
关键词
Computer simulations; convergence and robustness; recurrent neural networks; time-varying equation solving; OPTIMIZATION PROBLEMS; ITERATION METHODS; MATRIX EQUATION; CONVERGENCE; ALGORITHM; MODEL;
D O I
10.1109/TCYB.2017.2760883
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Solving Sylvester equation is a common algebraic problem in mathematics and control theory. Different from the traditional fixed-parameter recurrent neural networks, such as gradient-based recurrent neural networks or Zhang neural networks, a novel varying-parameter recurrent neural network, [called varying-parameter convergent-differential neural network (VP-CDNN)] is proposed in this paper for obtaining the online solution to the time-varying Sylvester equation. With time passing by, this kind of new varying-parameter neural network can achieve super-exponential performance. Computer simulation comparisons between the fixed-parameter neural networks and the proposed VP-CDNN via using different kinds of activation functions demonstrate that the proposed VP-CDNN has better convergence and robustness properties.
引用
收藏
页码:3135 / 3148
页数:14
相关论文
共 54 条
[1]  
Aarikka K., 1986, INTRO APPL MATH, V16
[2]  
[Anonymous], 1991, TOPICS MATRIX ANAL
[3]   ALGORITHM - SOLUTION OF MATRIX EQUATION AX+XB = C [J].
BARTELS, RH ;
STEWART, GW .
COMMUNICATIONS OF THE ACM, 1972, 15 (09) :820-&
[4]   Computing real low-rank solutions of Sylvester equations by the factored ADI method [J].
Benner, Peter ;
Kuerschner, Patrick .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2014, 67 (09) :1656-1672
[5]   Fast tensor product solvers for optimization problems with fractional differential equations as constraints [J].
Dolgov, Sergey ;
Pearson, John W. ;
Savostyanov, Dmitry V. ;
Stoll, Martin .
APPLIED MATHEMATICS AND COMPUTATION, 2016, 273 :604-623
[6]  
Ge S. S., 1998, ADAPTIVE NEURAL NETW
[7]   HESSENBERG-SCHUR METHOD FOR THE PROBLEM AX+XB=C [J].
GOLUB, GH ;
NASH, S ;
VANLOAN, C .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1979, 24 (06) :909-913
[8]   Smooth Representation Clustering [J].
Hu, Han ;
Lin, Zhouchen ;
Feng, Jianjiang ;
Zhou, Jie .
2014 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2014, :3834-3841
[9]   Modified conjugate gradient method for obtaining the minimum-norm solution of the generalized coupled Sylvester-conjugate matrix equations [J].
Huang, Na ;
Ma, Chang-Feng .
APPLIED MATHEMATICAL MODELLING, 2016, 40 (02) :1260-1275
[10]   Local graph regularized coding for salient object detection [J].
Huo, Lina ;
Yang, Shuyuan ;
Jiao, Licheng ;
Wang, Shuang ;
Shi, Jiao .
INFRARED PHYSICS & TECHNOLOGY, 2016, 77 :124-131