Journal
NEURAL PROCESSING LETTERS
Volume 50, Issue 2, Pages 1993-2005Publisher
SPRINGER
DOI: 10.1007/s11063-019-09983-x
Keywords
Gradient neural network; Moore-Penrose inverse; Global convergence; Parallel-computation
Categories
Ask authors/readers for more resources
Being with parallel-computation nature and convenience of hardware implementation, linear gradient neural networks (LGNN) are widely used to solve large-scale online matrix-involved problems. In this paper, two improved GNN (IGNN) models, which are activated by nonlinear functions, are first developed and investigated for Moore-Penrose inverse of full-rank matrix. The global convergence performances of such two models and LGNN models are theoretically analyzed. Two illustrative examples are performed to further demonstrate the theoretical results as well as the feasibility and efficacy of the proposed IGNN models for solving full-rank matrix Moore-Penrose inverse in real time. At last, a robot application example is provided to show the practical utility of the proposed IGNN models.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available