.png){kind=icon}
.png){kind=icon}
Return
A delayed neural network method for solving convex optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1142/S012906570600069X.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, the delayed projection neural network for a class of solving convex programming problem is proposed. The existence of solution and global exponential stability of the proposed network are proved, which can guarantee to converge at an exact optimal solution of the convex programming problems. Several examples are given to show the effectiveness of the proposed network.
Keywords:
global exponential stability
delayed projection neural network
convex programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.4
Papers:
1.2K
Citations:
3.3K
Organization
No organization information available