Zeroing neural networks (ZNN) approach, has been presented to solve a lot of
time-varying problems activated by monotonically increasing functions.
However, the existing ZNN models for timevarying quadratic programming based
on ZNN approach may be different from each other in structures, but share two
common restrictions, i.e., the function must be convex and unbounded. In
order to relax the above restrictions in solving time-varying quadratic
programming (TVQP) problems, this paper proposes a saturation-allowed
zeroing neural networks (SAZNN) model based on the ZNN approach. Comparing
with existing models, the activation function (AF) of SAZNN model tolerates
more kinds of functions, e.g., saturation function, non-convex function and
unbounded function. Finally, this paper provides simulation results
synthesized by the proposed SAZNN model activated by various AFs and
verifies the superiority of the proposed SAZNN model in terms of
convergence, efficiency and stability.