.png){kind=icon}
.png){kind=icon}
Return
An adaptive variable-parameter dynamic learning network for solving constrained time-varying QP problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2024.106968.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To efficiently solve the time-varying convex quadratic programming (TVCQP) problem under equational constraint, an adaptive variable-parameter dynamic learning network (AVDLN) is proposed and analyzed. Being different from existing varying-parameter and fixed-parameter convergent-differential neural network (VPCDNN and FPCDNN), the proposed AVDLN integrates the error signals into the time-varying parameter term. To do so, the TVCQP problem is transformed into a time-varying matrix equation. Second, an adaptive time-varying design formulation is designed for the error function, and then, the error function is integrated into the time-varying parameter. Furthermore, the AVDLN is designed with the adaptive time-varying design formulation. Moreover, the convergence and robustness theorems of AVDLN are proved by Lyapunov stability analysis, and Mathematical analysis demonstrates that AVDLN possesses a smaller upper bound on the convergence error and a faster error convergence rate than FPCDNN and VPCDNN. Finally, the validity of AVDLN is demonstrated by simulations, and the comparative results prove that the proposed AVDLN has a faster convergence speed and smaller error fluctuation.
Keywords:
Quadratic programming
Adaptive control
Time-varying systems
Optimization algorithms
Neural network
Journal
IF:
6.3
Papers:
7.8K
Citations:
3.0W