A dynamical model for solving degenerate quadratic minimax problems with constraints

  • Nazemi A
  • 3


    Mendeley users who have this article in their library.
  • 23


    Citations of this article.


This paper presents a new neural network model for solving degenerate quadratic minimax (DQM) problems. On the basis of the saddle point theorem, optimization theory, convex analysis theory, Lyapunov stability theory and LaSalle invariance principle, the equilibrium point of the proposed network is proved to be equivalent to the optimal solution of the DQM problems. It is also shown that the proposed network model is stable in the sense of Lyapunov and it is globally convergent to an exact optimal solution of the original problem. Several illustrative examples are provided to show the feasibility and the efficiency of the proposed method in this paper. © 2011 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Convergent
  • Dynamic system
  • Minimax problem
  • Neural network
  • Quadratic programming problem
  • Stability

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • A. R. Nazemi

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free