Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T02:33:38.392Z Has data issue: false hasContentIssue false

A NEURAL NETWORK FOR THE GENERALIZED NONLINEAR COMPLEMENTARITY PROBLEM OVER A POLYHEDRAL CONE

Published online by Cambridge University Press:  30 October 2015

YIFEN KE
Affiliation:
School of Mathematics and Computer Science, Fujian Normal University, Fuzhou 350117, PR China email yfke89@163.com
CHANGFENG MA*
Affiliation:
School of Mathematics and Computer Science, Fujian Normal University, Fuzhou 350117, PR China email macf@fjnu.edu.cn
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper, we consider a neural network model for solving the generalized nonlinear complementarity problem (denoted by GNCP) over a polyhedral cone. The neural network is derived from an equivalent unconstrained minimization reformulation of the GNCP, which is based on the penalized Fischer–Burmeister function ${\it\phi}_{{\it\mu}}(a,b)={\it\mu}{\it\phi}_{\mathit{FB}}(a,b)+(1-{\it\mu})a_{+}b_{+}$. We establish the existence and the convergence of the trajectory of the neural network, and study its Lyapunov stability, asymptotic stability and exponential stability. It is found that a larger ${\it\mu}$ leads to a better convergence rate of the trajectory. Simulation results are also reported.

Information

Type
Research Article
Copyright
© 2015 Australian Mathematical Publishing Association Inc.