A projection type steepest descent neural network for solving a class of nonsmooth optimization problems

被引:23
|
作者
Ebadi, M. J. [1 ]
Hosseini, Alireza [2 ,3 ]
Hosseini, M. M. [1 ]
机构
[1] Yazd Univ, Dept Math, POB 89195-741, Yazd, Iran
[2] Univ Tehran, Coll Sci, Sch Math Stat & Comp Sci, POB 14115-175, Tehran, Iran
[3] Inst Res Fundamental Sci IPM, Sch Math, POB 19395-5746, Tehran, Iran
关键词
Recurrent neural network; Nonsmooth optimization; Global convergence; Stability; Differential inclusion; Solution trajectory; LIMITING ACTIVATION FUNCTION; CONSTRAINED OPTIMIZATION; PROGRAMMING PROBLEMS; LINEAR OPTIMIZATION; FINITE-TIME; SUBJECT; COMPUTATION; EQUALITY; CIRCUIT;
D O I
10.1016/j.neucom.2017.01.010
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, a new one layer recurrent neural network is proposed to solve nonsmooth optimization problems with nonlinear inequality and linear equality constraints. Model is based on a differential inclusion and combines steepest descent and gradient projection methods simultaneously. Any solution trajectory of the introduced differential inclusion converges globally to the optimal solution set of the corresponding optimization problem. Comparing with the existing models for solving nonsmooth optimization problems, there does not exist any penalty parameter in the structure of the new model and the model has simple structure. Moreover, the optimal solution of the original optimization problem is equivalent to the equilibrium point of the proposed neural network. Some illustrative examples are presented to show the effectiveness and performance of the proposed neural network.
引用
收藏
页码:164 / 181
页数:18
相关论文
共 50 条