Discrete-time projection neural network methods for computing the solution of variational inequalities


Authors

Liping Zhang - School of Science, Sichuan University of Science and Engineering, Zigong 643000, China. Shu-Lin Wu - School of Science, Sichuan University of Science and Engineering, Zigong 643000, China.


Abstract

Neural networks are useful tools to solve mathematical and engineering problems. By using the implicit-explicit-method and the method proposed recently by Mohamad to discretize the continuous-time neural networks, we formulate two classes of discrete-time analogues to solve a system of variational inequalities. By adopting suitable Lyapunov functions and Razumikhintype techniques, exponential stability of the discrete neural networks are established in terms of linear matrix inequalities (LMIs). Several numerical experiments are performed to compare the convergence rates of the proposed discrete neural networks and it is shown that: (a) all of the discrete neural networks converge faster as the step size becomes larger, (b) the discrete neural networks derived by the semi-implicit Euler method performs best.


Share and Cite

  • Share on Facebook
  • Share on Twitter
  • Share on LinkedIn
ISRP Style

Liping Zhang, Shu-Lin Wu, Discrete-time projection neural network methods for computing the solution of variational inequalities, Journal of Nonlinear Sciences and Applications, 10 (2017), no. 4, 1896--1907

AMA Style

Zhang Liping, Wu Shu-Lin, Discrete-time projection neural network methods for computing the solution of variational inequalities. J. Nonlinear Sci. Appl. (2017); 10(4):1896--1907

Chicago/Turabian Style

Zhang, Liping, Wu, Shu-Lin. "Discrete-time projection neural network methods for computing the solution of variational inequalities." Journal of Nonlinear Sciences and Applications, 10, no. 4 (2017): 1896--1907


Keywords


MSC


References