Abstract
In this paper, a generalized neural network was proposed based on projection method and differential inclusions, which is contributed to solve a class of minimax optimization problems with linear constraints. It is proved that the solution trajectory can converge to the feasible region in the finite time when the initial point is not in the feasible region. Once the solution trajectory reaches the feasible region, it will stay therein thereafter. In addition, we investigate the global convergence and exponential convergence. Furthermore, three illustrative examples are given to show the efficiency of the proposed neural network.
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.
