کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10414049 896069 2014 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مهندسی مکانیک
پیش نمایش صفحه اول مقاله
A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints
چکیده انگلیسی
In this paper, the optimization techniques for solving pseudoconvex optimization problems are investigated. A simplified recurrent neural network is proposed according to the optimization problem. We prove that the optimal solution of the optimization problem is just the equilibrium point of the neural network, and vice versa if the equilibrium point satisfies the linear constraints. The proposed neural network is proven to be globally stable in the sense of Lyapunov and convergent to an exact optimal solution of the optimization problem. A numerical simulation is given to illustrate the global convergence of the neural network. Applications in business and chemistry are given to demonstrate the effectiveness of the neural network.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Communications in Nonlinear Science and Numerical Simulation - Volume 19, Issue 4, April 2014, Pages 789-798
نویسندگان
, , , ,