| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 411057 | Neurocomputing | 2010 | 6 Pages |
Abstract
This paper investigates a class of minimax problems, in which the cost functions are nonsmooth. A generalized neural network for solving the minimax problems was proposed, and its convergence was proven based on the nonsmooth analysis. The rate of convergence was discussed by virtue of the łojasiewicz inequality. Two numerical examples were given to illustrate the efficiency of the theoretical results.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Jiao Liu, Yongqing Yang, Zheng Fang,