Abstract
In this paper, we consider a neural network model for solving the nonlinear complementarity problem (NCP). The neural network is derived from an equivalent unconstrained minimization reformulation of the NCP, which is based on the generalized Fischer-Burmeister function φ{symbol}p (a, b) = {norm of matrix} (a, b) {norm of matrix}p - (a + b). We establish the existence and the convergence of the trajectory of the neural network, and study its Lyapunov stability, asymptotic stability as well as exponential stability. It was found that a larger p leads to a better convergence rate of the trajectory. Numerical simulations verify the obtained theoretical results.
Original language | English |
---|---|
Pages (from-to) | 697-711 |
Number of pages | 15 |
Journal | Information Sciences |
Volume | 180 |
Issue number | 5 |
DOIs | |
Publication status | Published - 2010 Mar 1 |
Keywords
- Exponentially convergent
- Generalized Fischer-Burmeister function
- Neural network
- The nonlinear complementarity problem
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Theoretical Computer Science
- Computer Science Applications
- Information Systems and Management
- Artificial Intelligence