Abstract
A special class of recurrent neural network (RNN), i.e., Zhang neural network (ZNN), has been proposed for a decade for solving online various time-varying problems. In this paper, we generalize and investigate a continuous-time ZNN model for online solution of the time-varying convex quadratic programming (QP) subject to a time-varying linear equality constraint. For the purpose of possible hardware (e.g., digital-circuit or digital-computer) realization, discrete-time ZNN models and numerical algorithms (i.e., discrete-time ZNN algorithms, in short) are proposed and developed by using Euler difference rules. Computer-simulation and numerical results demonstrate the efficacy and accuracy of the presented continuous-time ZNN model and the proposed discrete-time ZNN algorithms for solving online time-varying QP problems.
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.
