A Modified Neural Networks Approach for Solving Quadratic Programming Problems with equality and inequality constraints
Publish Year: 1397
نوع سند: مقاله کنفرانسی
زبان: English
View: 473
This Paper With 7 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
این Paper در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
IDS03_006
تاریخ نمایه سازی: 31 اردیبهشت 1398
Abstract:
In this paper, a modified neural network model for solving a class of constrained quadratic optimization problems is proposed. It is proved that the proposed neural network is globally stable in the sense of Lyapunov, and the output trajectory of the proposed neural network will converge globally to an optimal solution. The validity and transient behavior of the proposed neural network are demonstrated by using two numerical examples
Keywords:
dynamical system , strictly convex quadratic programming , stability , global convergence , recurrent neural network.
Authors
A Ghomashi
Department of Mathematics, Kermanshah Branch, Islamic Azad University, Kermanshah, Iran
M Abbasi
Department of Mathematics, Kermanshah Branch, Islamic Azad University, Kermanshah, Iran