A generalized neural network for solving a class of minimax optimization problems with linear constraints
详细信息查看全文 | 推荐本文 |
摘要
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.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700