首页|A One-Layer Recurrent Neural Network for Pseudoconvex Optimization Subject to Linear Equality Constraints
A One-Layer Recurrent Neural Network for Pseudoconvex Optimization Subject to Linear Equality Constraints
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
IEEE
In this paper, a one-layer recurrent neural network is presented for solving pseudoconvex optimization problems subject to linear equality constraints. The global convergence of the neural network can be guaranteed even though the objective function is pseudoconvex. The finite-time state convergence to the feasible region defined by the equality constraints is also proved. In addition, global exponential convergence is proved when the objective function is strongly pseudoconvex on the feasible region. Simulation results on illustrative examples and application on chemical process data reconciliation are provided to demonstrate the effectiveness and characteristics of the neural network.
Global convergencelinear equality constraintspseudoconvex optimizationrecurrent neural networks
Guo, Z.、Liu, Q.、Wang, J.
展开 >
Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC, USA
NETL
NSTL
IEEE
