Delayed neural network based on a new complementarity function for the NCP

被引:0
|
作者
Li, Yuan-Min [1 ]
Lei, Tianyv [1 ]
机构
[1] Xidian Univ, Sch Math & Stat, Xian 710071, Peoples R China
基金
中国国家自然科学基金;
关键词
Nonlinear complementarity problem; Complementarity function; Gradient neural network; Delayed neural network; Compressed sensing; OPTIMIZATION PROBLEMS; NONSMOOTH; SUBJECT;
D O I
10.1016/j.eswa.2024.123980
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Nonlinear complementarity problems (NCP) have been extensively studied in optimization due to its widespread applications. In this paper, we utilize the neural dynamic approach to solve the NCP. By integrating the famous FB function an NR function, we construct a new type of complementarity functions with one parameter p , which is aesthetically pleasing and easy to apply. Combined with the Lagrange multiplier method, a new type of merit function is also developed. Based on the complementarity function and merit function, we transform the NCP into an unconstrained minimization problem. Then, by KKT condition and gradient descent method, we propose a Lagrange neural network method. Under mild conditions, every equilibrium point of the proposed neural network model is a solution of the NCP. More importantly, by throwing a delay factor, we also develop a novel delayed neural network model. Both of these networks are shown to be global convergent, Lyapunov stable and exponential stable. Finally, we give some numerical experiments of the two neural network approaches and also give some applications to the compressed sensing signal reconstruction. Simulation results indicate that the parameter p in the complementarity function plays an important role on the convergence rate of the two neural networks. The delayed neural network outperforms the non-delayed neural network in some specific situations. It also demonstrates that the two networks can efficiently reconstruct the original signals.
引用
收藏
页数:15
相关论文
共 50 条
  • [1] Neural network approaches based on new NCP-functions for solving tensor complementarity problem
    Ya-Jun Xie
    Yi-Fen Ke
    Journal of Applied Mathematics and Computing, 2021, 67 : 833 - 853
  • [2] Neural network approaches based on new NCP-functions for solving tensor complementarity problem
    Xie, Ya-Jun
    Ke, Yi-Fen
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2021, 67 (1-2) : 833 - 853
  • [3] A New Smooth NCP Function for Solving Semidefinite Nonlinear Complementarity Problems
    Mohamed Ferhaoui
    Boubakeur Benahmed
    Lotfi Mouhadjer
    Bulletin of the Iranian Mathematical Society, 2022, 48 : 3909 - 3936
  • [4] A New Smooth NCP Function for Solving Semidefinite Nonlinear Complementarity Problems
    Ferhaoui, Mohamed
    Benahmed, Boubakeur
    Mouhadjer, Lotfi
    BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2022, 48 (06) : 3909 - 3936
  • [5] A novel neural network based on NCP function for solving constrained nonconvex optimization problems
    Effati, Sohrab
    Moghaddas, Mohammad
    COMPLEXITY, 2016, 21 (06) : 130 - 141
  • [6] Discovery of new complementarity functions for NCP and SOCCP
    Ma, Peng-Fei
    Chen, Jein-Shan
    Huang, Chien-Hao
    Ko, Chun-Hsu
    COMPUTATIONAL & APPLIED MATHEMATICS, 2018, 37 (05): : 5727 - 5749
  • [7] Discovery of new complementarity functions for NCP and SOCCP
    Peng-Fei Ma
    Jein-Shan Chen
    Chien-Hao Huang
    Chun-Hsu Ko
    Computational and Applied Mathematics, 2018, 37 : 5727 - 5749
  • [8] A novel generalization of the natural residual function and a neural network approach for the NCP
    Alcantara, Jan Harold
    Chen, Jein-Shan
    NEUROCOMPUTING, 2020, 413 : 368 - 382
  • [9] Neural networks based on three classes of NCP-functions for solving nonlinear complementarity problems
    Alcantara, Jan Harold
    Chen, Jein-Shan
    NEUROCOMPUTING, 2019, 359 : 102 - 113
  • [10] A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems
    Chen, Jein-Shan
    Ko, Chun-Hsu
    Pan, Shaohua
    INFORMATION SCIENCES, 2010, 180 (05) : 697 - 711