PubMed · 15787145
A recurrent neural network for solving nonlinear convex programs subject to linear constraints.
Abstract
In this paper, we propose a recurrent neural network for solving nonlinear convex programming problems with linear constraints. The proposed neural network has a simpler structure and a lower complexity for implementation than the existing neural networks for solving such problems. It is shown here that the proposed neural network is stable in the sense of Lyapunov and globally convergent to an optimal solution within a finite time under the condition that the objective function is strictly convex. Compared with the existing convergence results, the present results do not require Lipschitz continuity condition on the objective function. Finally, examples are provided to show the applicability of the proposed neural network.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Youshen Xia, Jun Wang. 2005. A recurrent neural network for solving nonlinear convex programs subject to linear constraints.. https://doi.org/10.1109/tnn.2004.841779
Cite the original work for its findings. Save a collection to share your selection of sources.