A generalized neural network for solving minimax problems with nonsmooth cost functions

Authors:
Jiao Liu;Yongqing Yang;Zheng Fang
Affiliations:
School of Science, Jiangnan University, Wuxi 214122, China;School of Science, Jiangnan University, Wuxi 214122, China;School of Science, Jiangnan University, Wuxi 214122, China
Venue:
Neurocomputing
Year:
2010

Citing 15
Cited 0

Linear-quadratic programming and optimal control

SIAM Journal on Control and Optimization
A regularization method for solving the finite convex min-max problem

SIAM Journal on Numerical Analysis
An interval maximum entropy method for a discrete minimax problem

Applied Mathematics and Computation
An Algorithm for the Inequality-Constrained Discrete Min--Max Problem

SIAM Journal on Optimization
Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints

Journal of Computational and Applied Mathematics
The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

SIAM Journal on Optimization
Applications of the general projection neural network in solving extended linear-quadratic programming problems with linear constraints

Neurocomputing
A project neural network for solving degenerate quadratic minimax problem with linear constraints

Neurocomputing
Evolutionary algorithms for minimax problems in robust design

IEEE Transactions on Evolutionary Computation
Subgradient-based neural networks for nonsmooth nonconvex optimization problems

IEEE Transactions on Neural Networks
An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity

Computers & Mathematics with Applications
A neural network for a class of convex quadratic minimax problems with constraints

IEEE Transactions on Neural Networks
A delayed neural network for solving linear projection equations and its analysis

IEEE Transactions on Neural Networks
Convergence of Neural Networks for Programming Problems via a Nonsmooth Łojasiewicz Inequality

IEEE Transactions on Neural Networks
An Improved Dual Neural Network for Solving a Class of Quadratic Programming Problems and Its -Winners-Take-All Application

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.02

Visualization

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 lojasiewicz inequality. Two numerical examples were given to illustrate the efficiency of the theoretical results.