Abstract
This paper presents a novel recurrent neural network for nonlinear convex programming. Under the condition that the objective function is convex and the constraint set is strictly convex or that the objective function is strictly convex and the constraint set is convex, the proposed neural network is proved to be stable in the sense of Lyapunov and globally convergent to an exact solution. Compared with the existing neural networks for solving such nonlinear optimization problems, the proposed neural network does not require an additional condition on the objective function and has a simple structure for implementation. Simulation results are given to illustrate further the global convergence and performance of the proposed neural network for constrained nonlinear optimization.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
