Abstract
In this paper, we describe a dynamic optimization technique for solving a class of nonlinear semidefinite programming based on Karush–Kuhn–Tucker optimality conditions. By employing Lyapunov function approach, it is investigated that the suggested neural network is stable in the sense of Lyapunov and globally convergent to an exact optimal solution of the original problem. The effectiveness of the proposed method is demonstrated by two numerical simulations.
Sign-in/Register to access full text options 
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.
