Next Article in Journal
CISMN: A Chaos-Integrated Synaptic-Memory Network with Multi-Compartment Chaotic Dynamics for Robust Nonlinear Regression
Previous Article in Journal
Efficient Numerical Methods for Reaction–Diffusion Problems Governed by Singularly Perturbed Fredholm Integro-Differential Equations
Previous Article in Special Issue
On the Evolution Operators of a Class of Time-Delay Systems with Impulsive Parameterizations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Semi-Global Polynomial Synchronization of High-Order Multiple Proportional-Delay BAM Neural Networks

1
Department of Mathematics, Harbin University, Harbin 150086, China
2
Heilongjiang Provincial Key Laboratory of the Intelligent Perception and Intelligent Software, Harbin University, Harbin 150080, China
3
School of Mathematical Science, Heilongjiang University, Harbin 150080, China
4
Heilongjiang Provincial Key Laboratory of the Theory and Computation of Complex Systems, Heilongjiang University, Harbin 150080, China
*
Authors to whom correspondence should be addressed.
Mathematics 2025, 13(9), 1512; https://doi.org/10.3390/math13091512 (registering DOI)
Submission received: 26 March 2025 / Revised: 29 April 2025 / Accepted: 29 April 2025 / Published: 4 May 2025

Abstract

:
This paper addresses the semi-global polynomial synchronization (SGPS) problem for a class of high-order bidirectional associative memory neural networks (HOBAMNNs) with multiple proportional delays. The time-delay-dependent semi-global polynomial stability criterion for error systems was established via a direct approach. The derived stability conditions are formulated as several simple inequalities that are readily solvable, facilitating direct verification using standard computational tools (e.g., YALMIP). Notably, this method can be applied to many system models with proportional delays after minor modifications. Finally, a numerical example is provided to validate the effectiveness of the theoretical results.

1. Introduction

Due to nonlinear computing capabilities and powerful parallel processing, neural networks (NNs) have played an important role in fields such as addressable memory, pattern recognition, and optimization control in recent decades [1,2]. A high-order NN capable of simulating auto-associative, hetero-associative, and multi-associative memory was proposed by Lee et al. [3] in 1986. Subsequently, various aspects of higher-order models have been extensively studied [4,5]. These higher-order NN models have higher fault tolerances, larger storage capacities, faster convergence speeds, and stronger approximation properties than first-order NNs.
Bidirectional associative memory NNs (BAMNNs) [6,7] consist of two layers of heterogeneous associative circuits, which extend the functionality of single-layer NNs and have the functions of memory and information association. In 1990, Simpson [8] put forward a class of HOBAMNNs. Since then, scholars had a strong interest in the research of delayed HOBAMNNs. In general, time delays considered for HOBAMNNs can be classified as constant delays [9], time-varying delays [10,11], leakage terms [12,13], and distributed delays [14]. In the implementation of NNs, in addition to the aforementioned types of delays, there also exists another crucial category of proportional delays. This is an unbounded time-varying delay that is different from constant delay, bounded time-varying delay, and distributed delay. The stability results of other types of time-delay systems cannot be applied to proportional delay systems directly too. For some time, an increasing number of scholars have started to pay attention to proportional-delay NNs (PDNNs) [15,16,17,18].
Pecora and Carroll proposed the concept of synchronization based on drive–response systems in [19]. It represents a state in which two or more systems exhibit common dynamic behaviors. When studying the dynamic behaviors of NNs, synchronization plays a crucial role. Since Zhou proposed the PDNNs in [20], the synchronization of PDNNs has also received much attention. A large number of manuscripts have emerged regarding the study of different types of synchronization problems for PDNNs: for example, asymptotic synchronization [21,22,23], exponential synchronization [24,25,26,27], finite-time synchronization [28,29,30,31,32], and fixed-time synchronization [33,34,35]. Regarding the implementation of synchronization between PDNNs, the majority of articles initially convert the proportional-delay drive–response systems into drive–response systems featuring constant delays and time-varying coefficients by means of nonlinear transformations. Then, corresponding methods are applied to derive sufficient conditions for synchronization: for example, the Lyapunov functionals (cited in [21,24,26,28,35]); the Lyapunov functionals and M-matrix method (cited in [27,36]); the matrix measure method (cited in [27]); the differential inequality techniques and the analysis approach (cited in [33,37,38]); the Lyapunov function and analytical methods (cited in [39]); the reciprocally convex technique combined with a new Lyapunov–Krasovskii functional (cited in [22]); the matrix measure strategy and the method based on the finite-time stability theorem of the Lyapunov approach (cited in [29]); the figure analysis method (cited in [30]); and the mean value inequality analysis (cited in [23]).
Polynomial stability differs from asymptotic stability and exponential stability. In terms of convergence rates, it is weaker than exponential stability and lies between asymptotic stability and exponential stability [17,18]. In the context of stability analyses for NNs, global power-rate stability and global polynomial stability are closely related concepts, both describing the convergence behavior of system trajectories over an unbounded state space. Global polynomial synchronization (GPS) is also an important synchronization method for PDNNs. It is a type of decaying synchronization, and its convergence rate is no higher than that of global exponential synchronization. In recent years, polynomial synchronization (PS) has emerged as a significant research direction in NN dynamics, achieving notable theoretical and practical advancements [40,41,42,43,44,45,46]. References [40,41] investigate the global power-rate synchronization (GP-RS) problem in different NNs. In [40], by utilizing the Leibniz rule for fractional-order derivatives and an extended comparison technique, the delay-dependent criteria for GP-RS were derived. In [41], by means of impulsive delay differential inequalities, sufficient conditions for achieving GP-RS in chaotic NNs under delay-dependent impulsive control laws are established. Zhou et al. [42] pioneered the concept of PS for recurrent NNs, employing inequality analysis techniques and constructing Lyapunov functionals to derive delay-dependent sufficient conditions for ensuring exponential synchronization and PS in drive–response systems. Subsequent studies expanded this framework to diverse NN architectures. For complex-valued inertial PDNNs, researchers developed synchronization criteria using a non-separated approach [43]. In the context of inertial PDNNs, scholars designed feedback controllers and reduced error systems to first-order differential equations through order reduction. By leveraging derivative definitions, matrix norm properties and Lagrange’s mean-value-theorem novel proportional-delay differential inequalities were established, resulting in matrix-norm-based synchronization criteria [44]. Addressing high-dimensional quaternion-valued systems, researchers achieved GPS through nonlinear controllers that integrate quaternion algebra with advanced inequality techniques [45]. Practical applications were further explored in parameter-uncertain proportional-delay memristive NNs, where the Lyapunov stability theory and inequality analysis yielded synchronization criteria that successfully applied to image encryption systems [46]. Collectively, these works have systematically advanced PS methodologies, demonstrating theoretical completeness in model generality, controller design, mathematical tool innovation, and real-world implementation.
The central aim of this paper is to devise a control law capable of ensuring the SGPS of multiple proportional-delay HOBAMNNs. The main contributions of this paper are as follows:
(1)
This is the first study on the SGPS of multiple proportional-delay HOBAMNNs, and the definition of SGPS here is obviously different from that of GPS.
(2)
This paper proposes a direct derivation method based on the system’s solution. Different from previous research results, it avoids using nonlinear transformation to convert PDNNs into constant delay NNs. This method simplifies the research process, avoids the complexity brought by constructing the Lyapunov–Krasovskii functional, and makes the structure of the paper more reasonable.
(3)
The established SGPS criterion not only enhances the convergence rate and accuracy but also enables straightforward implementation using the MATLAB R2016b 9.1 toolbox.
The remaining portion is structured as follows. The elaboration and preparatory work of the problem will be conducted in the next section. The major achievements of this research, a new standard for SGPS, are presented in Section 3. Illustrative examples are provided in Section 4 to verify the validity of the obtained results. Finally, in Section 5, we present our conclusions.
Notation: The real number and positive integer sets are denoted by R and N + , respectively. The symbol R l × s denotes the set consisting of l × s matrices. R l × s and R l × s are subsets of R l × s , with the former containing all nonnegative matrices and the latter containing all positive matrices. In a similar vein, we also utilize R and R , among others. For s N + , let R s be the linear space of all s-dimensional column vectors over R . The column-vectorizing operator is denoted by col ( · ) . The notations · 2 and · represent the Euclidean norm and -norm on R s , respectively.

2. Problem Description

Consider a class of multiple proportional-delay HOBAMNNs, which can be described as follows:
ζ ˙ i ( t ) = a i ζ i ( t ) + j Z m b i j h j ( ϑ j ( t ) ) + c i j l j ( ϑ j ( p i j t ) ) + j Z m l Z m d i j l j ( ϑ j ( p i j l t ) ) l ( ϑ l ( p i j l t ) ) + I i ( t ) , i Z n , t [ t 0 , ) ,
ϑ ˙ j ( t ) = a ^ j ϑ j ( t ) + i Z n b ^ j i h ˜ i ( ζ i ( t ) ) + c ^ j i l ˜ i ( ζ i ( p ^ j i t ) ) + i Z n r Z n d ^ j i r ˜ i ( ζ i ( p ^ j i r t ) ) ˜ r ( ζ r ( p ^ j i r t ) ) + I ˜ j ( t ) , j Z m , t [ t 0 , ) ,
ζ i ( s ) = φ i ( s ) , ϑ j ( s ) = ψ j ( s ) , δ t 0 s t 0 , i Z n , j Z m , δ = min min i Z n , j Z m p i j , min i Z n , j Z m p ^ j i , min i Z n , j , l Z m p i j l , min i , r Z n , j Z m p ^ j i r
where ζ i ( t ) and ϑ j ( t ) denote the ith and jth neuronal state of layer-X and layer-Y, respectively; t 0 0 is the initial time; h j ( · ) , h ˜ i ( · ) , l j ( · ) , l ˜ i ( · ) , j ( · ) , and ˜ i ( · ) are nonnegative activation functions; p i j , p ^ j i , p i j l and p ^ j i r denote the proportional delays: 0 < p i j < 1 , 0 < p ^ j i < 1 , 0 < p i j l < 1 , and 0 < p ^ j i r < 1 . a i and a ^ j are positive constants; constants b i j , b ^ j i , c i j , and c ^ j i represent the connection weights; d i j l and d ^ j i r are the second-order nonnegative connection weights; φ i ( s ) , ψ j ( s ) C [ δ t 0 , t 0 ] stands for the initial functions. I i ( t ) and I ^ j ( t ) denote the external inputs on the i-th and j-th neuron at time t. Z k = { 1 , 2 , , k } , k N + .
We require these assumptions:
Assumption 1.
There is h ¯ j , h ˜ ¯ i R such that h j ( 0 ) = h ˜ i ( 0 ) = 0 , 0 h j ( α 1 ) h j ( α 2 ) α 1 α 2 h ¯ j and 0 h ˜ i ( α 1 ) h ˜ i ( α 2 ) α 1 α 2 h ˜ ¯ i for any α 1 , α 2 R subject to α 1 α 2 , i Z n and j Z m .
Assumption 2.
There is l ¯ j , l ˜ ¯ i R such that l j ( 0 ) = l ˜ i ( 0 ) = 0 , 0 l j ( α 1 ) l j ( α 2 ) α 1 α 2 l ¯ j and 0 l ˜ i ( α 1 ) l ˜ i ( α 2 ) α 1 α 2 l ˜ ¯ i for any α 1 , α 2 R subject to α 1 α 2 , i Z n and j Z m .
Assumption 3.
There is ¯ j , ˜ ¯ i , R such that j ( 0 ) = ˜ i ( 0 ) = 0 , 0 j ( α 1 ) j ( α 2 ) α 1 α 2 ¯ j and 0 ˜ i ( α 1 ) ˜ i ( α 2 ) α 1 α 2 ˜ ¯ i for any α 1 , α 2 R subject to α 1 α 2 , i Z n and j Z m .
Assumption 4.
The activation functions j ( · ) and ˜ i ( · ) satisfy γ ˜ j ( 1 ) j ( s ) γ ˜ j ( 1 ) , γ ˜ i ( 2 ) ˜ i ( s ) γ ˜ i ( 2 ) for any t t 0 , s R , i Z n , j Z m , where γ ˜ j ( 1 ) and γ ˜ i ( 2 ) are positive scalars.
We regard higher-order BAMNN (1) as a master drive system and consider the following form of slave matching response systems:
ζ ^ ˙ i ( t ) = a i ζ ^ i ( t ) + j Z m b i j h j ( ϑ ^ j ( t ) ) + c i j l j ( ϑ ^ j ( p i j t ) ) + j Z m l Z m d i j l j ( ϑ ^ j ( p i j l t ) ) l ( ϑ ^ l ( p i j l t ) ) + I i ( t ) + U i ( t ) , i Z n , t [ t 0 , ) ,
ϑ ^ ˙ j ( t ) = a ^ j ϑ ^ j ( t ) + i Z n b ^ j i h ˜ i ( ζ ^ i ( t ) ) + c ^ j i l ˜ i ( ζ ^ i ( p ^ j i t ) ) + i Z n r Z n d ^ j i r ˜ i ( ζ ^ i ( p ^ j i r t ) ) ˜ r ( ζ ^ r ( p ^ j i r t ) ) + I ˜ j ( t ) + V j ( t ) , j Z m , t [ t 0 , ) ,
ζ ^ i ( s ) = φ ^ i ( s ) , ϑ ^ j ( s ) = ψ ^ j ( s ) , δ t 0 s t 0 , i Z n , j Z m ,
where U i ( t ) and V j ( t ) are the controllers for realizing the SGPS.
Let ϵ i ( t ) = ζ i ( t ) ζ ^ i ( t ) and ϵ ˜ j ( t ) = ϑ j ( t ) ϑ ^ j ( t ) . Take ϵ i ( t ) and ϵ ˜ j ( t ) as the synchronization error variables. Then, from Equations (1) and (2), we can obtain the error dynamical system:
ϵ ˙ i ( t ) = a i ϵ i ( t ) + j Z m b i j h j * ( ϵ ˜ j ( t ) ) + c i j l j * ( ϵ ˜ j ( p i j t ) ) + j Z m l Z m d i j l j ( ϑ j ( p i j l t ) ) l * ( ϵ ˜ l ( p i j l t ) ) + j * ( ϵ ˜ j ( p i j l t ) ) l ( ϑ ^ l ( p i j l t ) ) U i ( t ) , i Z n , t [ t 0 , ) ,
ϵ ˜ ˙ j ( t ) = a ^ j ϵ ˜ j ( t ) + i Z n b ^ j i h ˜ i * ( ϵ i ( t ) ) + c ^ j i l ˜ i * ( ϵ i ( p ^ j i t ) ) + i Z n r Z n d ^ j i r ˜ i ( ζ i ( p ^ j i r t ) ) ˜ r * ( ϵ r ( p ^ j i r t ) ) + ˜ i * ( ϵ i ( p ^ j i r t ) ) ˜ r ( ζ ^ r ( p ^ j i r t ) ) V j ( t ) , j Z m , t [ t 0 , ) ,
ϵ i ( s ) = ρ i ( s ) , ϵ ˜ j ( s ) = ϱ j ( s ) , δ t 0 s t 0 , i Z n , j Z m ,
where
h j * ( ϵ ˜ j ( · ) ) = h j ( ϵ ˜ j ( · ) + ϑ ^ j ( · ) ) h j ( ϑ ^ j ( · ) ) ,
h ˜ i * ( ϵ i ( · ) ) = h ˜ i ( ϵ i ( · ) + ζ ^ i ( · ) ) h ˜ i ( ζ ^ i ( · ) ) ,
l j * ( ϵ ˜ j ( · ) ) = l j ( ϵ ˜ j ( · ) + ϑ ^ j ( · ) ) l j ( ϑ ^ j ( · ) ) ,
l ˜ i * ( ϵ i ( · ) ) = l ˜ i ( ϵ i ( · ) + ζ ^ i ( · ) ) l ˜ i ( ζ ^ i ( · ) ) ,
j * ( ϵ ˜ j ( · ) ) = j ( ϵ ˜ j ( · ) + ϑ ^ j ( · ) ) j ( ϑ ^ j ( · ) ) ,
˜ i * ( ϵ i ( · ) ) = ˜ i ( ϵ i ( · ) + ζ ^ i ( · ) ) ˜ i ( ζ ^ i ( · ) ) .
ρ i ( s ) = φ i ( s ) φ ^ i ( s ) , ϱ j ( s ) = ψ j ( s ) ψ ^ j ( s )
Due to Assumptions 1–3, we deduce that
| h j * ( ω ) | h ¯ j | ω | , | h ˜ i * ( ω ) | h ˜ ¯ i | ω | , | l j * ( ω ) | l ¯ j | ω | , | l ˜ i * ( ω ) | l ˜ ¯ i | ω | , | j * ( ω ) | ¯ j | ω | , | ˜ i * ( ω ) | ˜ ¯ i | ω | , ω R , i Z n , j Z m .
Remark 1.
Assumptions 1–4 guarantee the existence and uniqueness of the solutions to the considered differential equations, ensuring that the solutions of the system will not diverge within a finite time, thus guaranteeing the effectiveness of the stability analysis. The assumptions about the activation functions prevent the nonlinear terms from causing system instability due to excessive amplification in the state space. In the analysis of the synchronization error dynamics, these assumptions help simplify the estimation of the coupling terms and interaction terms.
Let
ϵ i ( t ) = ζ i ( t ) ζ ^ i ( t ) , ϵ ˜ j ( t ) = ϑ j ( t ) ϑ ^ j ( t ) .
Definition 1
([18]). The HOBAMNN (1) is said to be semi-globally polynomially stable, if there exist scalars R > 0 , K > 0 , and β > 0 such that
ζ ( t ) 2 2 + ϑ ( t ) 2 2 1 / 2 K ( φ , ψ ) 1 + t 1 + t 0 β
for any t t 0 , φ C ( [ δ t 0 , t 0 ] , R n ) and ψ C ( [ δ t 0 , t 0 ] , R m ) subject to ( φ , ψ ) < R , where
ζ ( t ) = col ( ζ 1 ( t ) , ζ 2 ( t ) , , ζ n ( t ) ) , ϑ ( t ) = col ( ϑ 1 ( t ) , ϑ 2 ( t ) , , ϑ m ( t ) ) ,
( φ , ψ ) = sup s [ δ t 0 , t 0 ] max φ ( s ) , ψ ( s ) ,
φ ( s ) = col ( φ 1 ( s ) , φ 2 ( s ) , , φ n ( s ) ) , ψ ( s ) = col ( ψ 1 ( s ) , ψ 2 ( s ) , , ψ m ( s ) ) .
Specifically, when R = + , HOBAMNN (1) is defined as globally polynomially stable.
Remark 2.
Global polynomial stability requires that the system polynomially converges to the equilibrium state under all initial conditions in the entire state space. In contrast, semi-global polynomial stability requires that the system polynomially converges to the equilibrium state corresponding to the initial conditions within some fixed bounded set. In the case of global polynomial stability, the polynomial decay rate is consistent for any initial state, but for semi-global polynomial stability, the decay rate depends on the selected set.
Definition 2.
The response HOBAMNN (2) and HOBAMNN (1) are said to achieve SGPS, if there exist scalars R > 0 , K > 0 , and λ > 0 such that any solution ( ϵ ( t ) , ϵ ˜ ( t ) ) of error dynamical system (3) satisfies
ϵ ( t ) 2 2 + ϵ ˜ ( t ) 2 2 1 / 2 K ( ϖ , ϖ ˜ ) 1 + t 1 + t 0 λ
for any t t 0 , ϖ C ( [ δ t 0 , t 0 ] , R n ) and ϖ ˜ C ( [ δ t 0 , t 0 ] , R m ) subject to ( ϖ , ϖ ˜ ) < R , where
ϵ ( t ) = col ( ϵ 1 ( t ) , ϵ 2 ( t ) , , ϵ n ( t ) ) , ϵ ˜ ( t ) = col ( ϵ ˜ 1 ( t ) , ϵ ˜ 2 ( t ) , , ϵ ˜ m ( t ) ) ,
( ϖ , ϖ ˜ ) = sup s [ δ t 0 , t 0 ] max ϖ ( s ) , ϖ ˜ ( s ) ,
ϖ ( s ) = col ( ϖ 1 ( s ) , ϖ 2 ( s ) , , ϖ n ( s ) ) , ϖ ˜ ( s ) = col ( ϖ ˜ 1 ( s ) , ϖ ˜ 2 ( s ) , , ϖ ˜ m ( s ) ) .
That is, the error system (3) controlled by the controllers U i ( t ) and V j ( t ) is semi-globally polynomially stable.
The objective of this paper is to design a state feedback controller of the following form:
U i ( t ) = ( μ i a i ) ϵ i ( t ) , i Z n , t t 0 , V j ( t ) = ( μ ˜ j a ^ j ) ϵ ˜ j ( t ) , j Z m , t t 0 ,
which allows HOBAMNNs (1) and (2) achieve SGPS, where μ i > 0 and μ ˜ j > 0 are the controller gains to be determined. In other words, the goal is to derive new sufficient conditions that ensure that the error dynamical system (3) exhibits semi-global polynomial stability.

3. Main Results

Lemma 1
([18]). Let κ ( x ) = ( τ ¯ γ ) ( x T ) τ ln ( 1 + x 1 + T ) , x ( 1 , T ] , where γ, τ ¯ , τ, and T are positive scalars such that τ ¯ γ τ and T > t 0 . Then, for all x [ t 0 , T ] , the following inequality holds: κ ( x ) 0 ; that is, τ ¯ ( x T ) τ ln ( 1 + x 1 + T ) γ ( x T ) for any x [ t 0 , T ] .
Theorem 1.
Under Assumptions 1–4, let known positive scalars ζ, ϑ, λ, μ i , μ ˜ j , η i , and η ˜ j be subject to
λ < min min i Z n ( μ i η i ) , min j Z m ( μ ˜ j η ˜ j )
if there are ζ ˜ i > 0 and ϑ ˜ j > 0 such that
1 + Δ ˜ i ζ ˜ i ,
1 + ˜ j ϑ ˜ j ,
where
Δ ˜ i = j Z m Δ ˜ i j ϑ ˜ j , Δ ˜ i j = Θ i j + Ξ i j ,
˜ j = i Z n ˜ j i ζ ˜ i , ˜ j i = Θ ¯ j i + Ξ ¯ j i ,
Θ i j = | b i j | h ¯ j + | c i j | l ¯ j p i j λ η i , Θ ¯ j i = | b ^ j i | h ˜ ¯ i + | c ^ j i | l ˜ ¯ i p ^ j i λ η ˜ j ,
Ξ i j = l Z m γ ˜ l ( 1 ) | d i l j | p i l j λ + | d i j l | p i j l λ ¯ j η i ,
Ξ ¯ j i = r Z n γ ˜ r ( 2 ) | d ^ j r i | p ^ j r i λ + | d ^ j i r | p ^ j i r λ ˜ ¯ i η ˜ j ,
Then, error system (3) is semi-globally polynomially stable; that is, the drive system HOBAMNN (1) and response system HOBAMNN (2) achieve SGPS.
Proof. 
Choose Υ > 1 such that
Υ ζ ˜ col ( 1 1 ) , Υ ϑ ˜ col ( 1 1 ) .
where
ζ ˜ = col ( ζ ˜ 1 ζ ˜ n ) , ϑ ˜ = col ( ϑ ˜ 1 ϑ ˜ m ) .
For any fixed initial functions ϖ C ( [ δ t 0 , t 0 ] , R n ) and ϖ ˜ C ( [ δ t 0 , t 0 ] , R m ) , define
ϵ ^ ( t ) = Υ ( ϖ , ϖ ˜ ) 1 + t 1 + t 0 λ ζ ˜ , t δ t 0 ,
ϵ ˜ ^ ( t ) = Υ ( ρ , ϱ ) 1 + t 1 + t 0 λ ϑ ˜ , t δ t 0 .
Suppose that ( ϵ ( t ) , ϵ ˜ ( t ) ) is a solution of the error system (3). Next, the following expression will be proven:
| ϵ ( t ) | ϵ ^ ( t ) , | ϵ ˜ ( t ) | ϵ ˜ ^ ( t ) , t δ t 0 ,
i.e.,
| ϵ ( t ) | Υ ( ϖ , ϖ ˜ ) 1 + t 1 + t 0 λ ζ ˜ , t δ t 0 ,
| ϵ ˜ ( t ) | Υ ( ϖ , ϖ ˜ ) 1 + t 1 + t 0 λ ϑ ˜ , t δ t 0 .
Based on (5), it is obtained that
ϵ ˙ i ( t ) = μ i ϵ i ( t ) + j Z m b i j h j * ( ϵ ˜ j ( t ) ) + c i j l j * ( ϵ ˜ j ( p i j t ) ) + j Z m l Z m d i j l j ( ϑ j ( p i j l t ) ) l * ( ϵ ˜ l ( p i j l t ) ) + j * ( ϵ ˜ j ( p i j l t ) ) l ( ϑ ^ l ( p i j l t ) ) , i Z n , t [ t 0 , ) .
By multiplying both sides of Equation (12) by e μ i ( t t 0 ) and then taking the integration from t 0 to t, we have
ϵ i ( t ) = e μ i ( t t 0 ) ϵ i ( t 0 ) + j Z m b i j t 0 t e μ i ( ω t ) h j * ( ϵ ˜ j ( ω ) ) d ω + j Z m c i j t 0 t e μ i ( ω t ) l j * ( ϵ ˜ j ( p i j ω ) ) d ω + j Z m l Z m d i j l t 0 t e μ i ( ω t ) j ( ϑ j ( p i j l ω ) ) l * ( ϵ ˜ l ( p i j l ω ) ) | + j * ( ϵ ˜ j ( p i j l ω ) ) l ( ϑ ^ l ( p i j l ω ) ) d ω , i Z n , t [ t 0 , ) .
According to Assumptions 1–3 and 4, one can derive
| ϵ i ( t ) | e μ i ( t t 0 ) | ρ i ( t 0 ) | + j Z m | b i j | h ¯ j t 0 t e μ i ( ω t ) | ϵ ˜ j ( ω ) | d ω + j Z m | c i j | l ¯ j t 0 t e μ i ( ω t ) | ϵ ˜ j ( p i j ω ) | d ω + j Z m l Z m | d i j l | t 0 t e μ i ( ω t ) γ j ( 1 ) ¯ l | ϵ ˜ l ( p i j l ω ) | + ¯ j γ l ( 1 ) | ϵ ˜ j ( p i j l ω ) | d ω , i Z n , t [ t 0 , ) .
Analogously, we can obtain
| ϵ ˜ j ( t ) | e μ ˜ j ( t t 0 ) | ϱ j ( t 0 ) | + i Z n | b ^ j i | h ˜ ¯ i t 0 t e μ ˜ j ( ω t ) | ϵ i ( ω ) | d ω + i Z n | c ^ j i | l ˜ ¯ i t 0 t e μ ˜ j ( ω t ) | ϵ i ( p ^ j i ω ) | d ω + i Z n r Z n | d ^ j i r | t 0 t e μ ˜ j ( ω t ) γ ˜ i ( 2 ) ˜ ¯ r | ϵ r ( p ^ j i r ω ) | + ˜ ¯ i γ ˜ r ( 2 ) | ϵ i ( p ^ j i r ω ) | d ω , j Z m , t [ t 0 , ) .
Clearly, (11) holds for any t [ δ t 0 , t 0 ] . Assume that (11) is not true for all t ( t 0 , + ) . Then, the following (i) or (ii) is true:
(i)
When t 0 < t T , there is T and i * Z n such that (11) is true, and
| ϵ i * ( T ) | = Υ ( ϖ , ϖ ˜ ) 1 + T 1 + t 0 λ ζ ˜ i * ,
(ii)
When t 0 < t T , there is T and j * Z m such that (11) is true, and
| ϵ ˜ j * ( T ) | = Υ ( ϖ , ϖ ˜ ) 1 + T 1 + t 0 λ ϑ ˜ j * .
Case 1: (i) holds. From (14) and (11b), we derive
| ϵ i * ( T ) | Υ ( ϖ , ϖ ˜ ) e μ i * ( T t 0 ) + j Z m | b i * j | h ¯ j ϑ ˜ j Υ ( ϖ , ϖ ˜ ) t 0 T e μ i * ( ω T ) 1 + ω 1 + t 0 λ d ω + j Z m | c i * j | l ¯ j p i * j λ ϑ ˜ j Υ ( ϖ , ϖ ˜ ) t 0 T e μ i * ( ω T ) 1 + ω 1 + t 0 λ d ω + j Z m l Z m | d i * j l | t 0 T e μ i * ( ω T ) γ ˜ j ( 1 ) ¯ l p i * j l λ ϑ ˜ l Υ ( ϖ , ϖ ˜ ) 1 + ω 1 + t 0 λ + ¯ j γ ˜ l ( 1 ) p i * j l λ ϑ ˜ j Υ ( ϖ , ϖ ˜ ) 1 + ω 1 + t 0 λ d ω = Υ ( ϖ , ϖ ˜ ) 1 + T 1 + t 0 λ e μ i * ( T t 0 ) 1 + T 1 + t 0 λ + j Z m | b i * j | h ¯ j ϑ ˜ j t 0 T e μ i * ( ω T ) 1 + ω 1 + T λ d ω + j Z m | c i * j | l ¯ j p i * j λ ϑ ˜ j t 0 T e μ i * ( ω T ) 1 + ω 1 + T λ d ω + j Z m l Z m | d i * j l | γ ˜ j ( 1 ) ¯ l p i * j l λ ϑ ˜ l + ¯ j γ ˜ l ( 1 ) p i * j l λ ϑ ˜ j × t 0 T e μ i * ( ω T ) 1 + ω 1 + T λ d ω
= Υ ( ϖ , ϖ ˜ ) 1 + T 1 + t 0 λ e μ i * ( T t 0 ) 1 + T 1 + t 0 λ + j Z m | b i * j | h ¯ j + | c i * j | l ¯ j p i * j λ ϑ ˜ j + j Z m l Z m | d i * l j | γ ˜ l ( 1 ) ¯ j p i * l j λ + | d i * j l | ¯ j γ ˜ l ( 1 ) p i * j l λ ϑ ˜ j × t 0 T e μ i * ( ω T ) 1 + ω 1 + T λ d ω = Υ ( ϖ , ϖ ˜ ) 1 + T 1 + t 0 λ e μ i * ( T t 0 ) 1 + T 1 + t 0 λ + η i * Δ ˜ i * t 0 T e μ i * ( ω T ) 1 + ω 1 + T λ d ω ,
where
Δ ˜ i * = j Z m Δ ˜ i * j ϑ ˜ j . Δ ˜ i * j = Θ i * j + Ξ i * j ,
Noting that e μ i * ( ω T ) λ ln 1 + ω 1 + T e η i * ( ω T ) for any ω [ t 0 , T ] from Lemma 1, we have from (7a) that
| ϵ i * ( T ) | Υ ( ϖ , ϖ ˜ ) 1 + T 1 + t 0 λ e η i * ( t 0 T ) + η i * Δ ˜ i * t 0 T e η i * ( ω T ) d ω Υ ( ϖ , ϖ ˜ ) 1 + T 1 + t 0 λ ( 1 + Δ ˜ i * ) ,
We have | ϵ i * ( T ) | < Υ ( ϖ , ϖ ˜ ) 1 + T 1 + t 0 λ ζ ˜ i * , which contradicts (16).
Case 2: (ii) holds. Using (15) and (11a), we derive
| ϵ ˜ j * ( T ) | Υ ( ϖ , ϖ ˜ ) e μ ˜ j * ( T t 0 ) + i Z n | b ^ j * i | h ˜ ¯ i ζ ˜ i Υ ( ϖ , ϖ ˜ ) t 0 T e μ ˜ j * ( ω T ) 1 + ω 1 + t 0 λ d ω + i Z n | c ^ j * i | l ˜ ¯ i p ^ j * i λ ζ ˜ i Υ ( ϖ , ϖ ˜ ) t 0 T e μ ˜ j * ( ω T ) 1 + ω 1 + t 0 λ d ω + i Z n r Z n | d ^ j * i r | t 0 T e μ ˜ j * ( ω T ) γ ˜ i ( 2 ) ˜ ¯ r p ^ j * i r λ ζ ˜ r Υ ( ϖ , ϖ ˜ ) 1 + ω 1 + t 0 λ + ˜ ¯ i γ ˜ r ( 2 ) p ^ j * i r λ ζ ˜ i Υ ( ϖ , ϖ ˜ ) 1 + ω 1 + t 0 λ d ω = Υ ( ϖ , ϖ ˜ ) 1 + T 1 + t 0 λ e μ ˜ j * ( T t 0 ) 1 + T 1 + t 0 λ + i Z n | b ^ j * i | h ˜ ¯ i ζ ˜ i t 0 T e μ ˜ j * ( ω T ) 1 + ω 1 + T λ d ω + i Z n | c ^ j * i | l ˜ ¯ i p ^ j * i λ ζ ˜ i t 0 T e μ ˜ j * ( ω T ) 1 + ω 1 + T λ d ω + i Z n r Z n | d ^ j * i r | γ ˜ i ( 2 ) ˜ ¯ r p ^ j * i r λ ζ ˜ r + | d ^ j * i r | ˜ ¯ i γ ˜ r ( 2 ) p ^ j * i r λ ζ ˜ i t 0 T e μ ˜ j * ( ω T ) 1 + ω 1 + T λ d ω
= Υ ( ϖ , ϖ ˜ ) 1 + T 1 + t 0 λ e μ ˜ j * ( T t 0 ) 1 + T 1 + t 0 λ + i Z n | b ^ j * i | h ˜ ¯ i ζ ˜ i t 0 T e μ ˜ j * ( ω T ) 1 + ω 1 + T λ d ω + i Z n | c ^ j * i | l ˜ ¯ i p ^ j * i λ ζ ˜ i t 0 T e μ ˜ j * ( ω T ) 1 + ω 1 + T λ d ω + i Z n r Z n | d ^ j * r i | γ ˜ r ( 2 ) ˜ ¯ i p ^ j * r i λ ζ ˜ i + | d ^ j * i r | ˜ ¯ i γ ˜ r ( 2 ) p ^ j * i r λ ζ ˜ i t 0 T e μ ˜ j * ( ω T ) 1 + ω 1 + T λ d ω = Υ ( ϖ , ϖ ˜ ) 1 + T 1 + t 0 λ e μ ˜ j * ( T t 0 ) 1 + T 1 + t 0 λ + i Z n | b ^ j * i | h ˜ ¯ i + | c ^ j * i | l ˜ ¯ i p ^ j * i λ ζ ˜ i + i Z n r Z n | d ^ j * r i | γ ˜ r ( 2 ) ˜ ¯ i p ^ j * r i λ + | d ^ j * i r | ˜ ¯ i γ ˜ r ( 2 ) p ^ j * i r λ ζ ˜ i × t 0 T e μ ˜ j * ( ω T ) 1 + ω 1 + T λ d ω
= Υ ( ϖ , ϖ ˜ ) 1 + T 1 + t 0 λ e μ ˜ j * ( T t 0 ) 1 + T 1 + t 0 λ + η ˜ j * ˜ j * t 0 T e μ ˜ j * ( ω T ) 1 + ω 1 + T λ d ω ,
where
˜ j * = i Z n ˜ j * i ζ ˜ i , ˜ j * i = Θ ¯ j * i + Ξ ¯ j * i .
Noting that e μ ˜ j * ( ω T ) λ ln 1 + ω 1 + T e η ˜ j * ( ω T ) for any ω [ t 0 , T ] from Lemma 1, we have from (7b) that
| ϵ ˜ j * ( T ) | Υ ( ϖ , ϖ ˜ ) 1 + T 1 + t 0 λ e η ˜ j * ( t 0 T ) + η ˜ j * ˜ j * t 0 T e η ˜ j * ( ω T ) d ω Υ ( ϖ , ϖ ˜ ) 1 + T 1 + t 0 λ ( 1 + ˜ j * ) ,
We obtain | ϵ ˜ j * ( T ) | < Υ ( ϖ , ϖ ˜ ) 1 + T 1 + t 0 λ ϑ ˜ j * , which contradicts (16).
Consequently, for all t [ t 0 , + ) , (11) is true. Therefore,
i Z n ϵ i 2 ( t ) + j Z m ϵ ˜ j 2 ( t ) i Z n Υ 2 ζ ˜ i 2 ( ϖ , ϖ ˜ ) 2 1 + t 1 + t 0 2 λ + j Z m Υ 2 ϑ ˜ j 2 ( ϖ , ϖ ˜ ) 2 1 + t 1 + t 0 2 λ Γ 2 ( ϖ , ϖ ˜ ) 2 1 + t 1 + t 0 2 λ , t t 0 ,
where Γ = i Z n Υ 2 ζ ˜ i 2 + j Z m Υ 2 ϑ ˜ j 2 1 / 2 .
In accordance with Definition 2, error system (3) is semi-globally polynomially stable; that is, the drive system HOBAMNN (1) and response system HOBAMNN (2) achieve SGPS. □

4. Illustrative Examples

Next, the effectiveness of the results given in this paper will be illustrated through a specific numerical example.
Example 1.
Consider drive and response HOBAMNNs (1) and (2) with the controllers in (5): let n = 2 ; m = 2 ; a 1 = 0.4 ; a 2 = 0.4 ; a ^ 1 = 0.3 ; a ^ 2 = 0.4 ; b 11 = 1.2 ; b 12 = 0.6 ; b 21 = 1.3 ; b 22 = 0.24 ; b ^ 11 = 1.2 ;   b ^ 12 = 0.42 ;   b ^ 21 = 2.2 ;   b ^ 22 = 0.22 ; c 11 = 1.3 ;   c 12 = 1.5 ;   g c 21 = 2.4 ; c 22 = 1.1 ; c ^ 11 = 0.16 ;   c ^ 12 = 0.36 ;   c ^ 21 = 0.12 ;   c ^ 22 = 0.43 ; d 111 = 1 ;   d 112 = 2 ;   d 121 = 1 ; d 122 = 1 ; d 211 = 2 ;   d 212 = 1 ;   d 221 = 1 ;   d 222 = 0.5 ; d ^ 111 = 0.1 ;   d ^ 112 = 0.3 ;   d ^ 121 = 0.1 ;   d ^ 122 = 0.3 ; d ^ 211 = 0.1 ;   d ^ 212 = 0.21 ;   d ^ 221 = 0.2 ;   d ^ 222 = 0.11 ; p 11 = 0.5 ;   p 12 = 0.4 ;   p 21 = 0.2 ;   p 22 = 0.8 ; p ^ 11 = 0.7 ;   p ^ 12 = 0.1 ;   p ^ 21 = 0.2 ;   p ^ 22 = 0.9 ; p 111 = p 112 = p 121 = p 211 = p 212 = p 221 = p 222 = 0.8 ;   p 122 = 0.9 ; p ^ 111 = p ^ 112 = p ^ 121 = p ^ 122 = 0.8 ; p ^ 211 = 0.4 ;   p ^ 212 = 0.6 ; p ^ 221 = 0.3 ; p ^ 222 = 0.7 .
h 1 ( s ) = 0.2 s tanh 2 ( s ) , h 2 ( s ) = 0.3 s tanh 2 ( s ) ,
h ˜ 1 ( s ) = 0.03 s tanh 2 ( s ) , h ˜ 2 ( s ) = 0.2 s tanh 2 ( s ) ,
l 1 ( s ) = 0.3 s tanh 2 ( s ) , l 2 ( s ) = 0.04 s tanh 2 ( s ) ,
l ˜ 1 ( s ) = 0.04 s tanh 2 ( s ) , l ˜ 2 ( s ) = 0.02 s tanh 2 ( s ) ,
1 ( s ) = 2 ( s ) = 0.2 tanh ( s ) , ˜ 1 ( s ) = ˜ 2 ( s ) = 0.3 tanh ( s ) , s R .
Clearly, set the following: h ¯ 1 = 0.2 ;   h ¯ 2 = 0.3 ; h ˜ ¯ 1 = 0.03 ;   h ˜ ¯ 2 = 0.2 ; l ¯ 1 = 0.3 ;   l ¯ 2 = 0.04 ; l ˜ ¯ 1 = 0.04 ; l ˜ ¯ 2 = 0.02 ; ¯ 1 = ¯ 2 ( s ) = 0.2 ;   ˜ ¯ 1 = ˜ ¯ 2 ( s ) = 0.3 ; γ ˜ 1 ( 1 ) = γ ˜ 2 ( 1 ) = 0.2 ; γ ˜ 1 ( 2 ) = γ ˜ 2 ( 2 ) = 0.3 . Assumptions 1–4 are satisfied.
When λ = 0.05 ,   μ 1 = 2.6 ,   μ 1 = 1.6 ,   μ ˜ 1 = 2.0 ,   μ ˜ 1 = 1.8 , η 1 = 2.54 ,   η 2 = 1.54 ,   η ˜ 1 = 1.94 ,   and η ˜ 2 = 1.74 , by solving inequalities (7a) and (7b) in Theorem 1, the following feasible solutions are obtained:
u ˜ = [ 3.0386 , 4.3666 ] T , v ˜ = [ 2.4361 , 2.5156 ] T .
It can be readily verified that the conditions of Theorem 1 in our paper are met. Consequently, based on Theorem 1 in our paper, the drive system given by (1) and the response system given by (2) experience semi-global polynomial synchronization under controllers (5). We choose the initial values of the state variables as ζ ( s ) = [ 0.4 , 0.5 ] T , ϑ ( s ) = [ 0.2 , 0.1 ] T , ζ ^ ( s ) = [ 0.6 , 0.3 ] T , and ϑ ^ ( s ) = [ 0.4 , 0.6 ] T . We also define the external input as I 1 = I 2 = 0 ,   J 1 = J 2 = 0 . The error curves of drive–response systems ϵ 1 ( t ) , ϵ 2 ( t ) , ϵ ˜ 1 ( t ) , and ϵ ˜ 2 ( t ) are shown in Figure 1; the curves of variables ζ 1 ( t ) , ζ 2 ( t ) , ϑ 1 ( t ) , ϑ 2 ( t ) , ζ ^ 1 ( t ) , ζ ^ 2 ( t ) , ϑ ^ 1 ( t ) , and ϑ ^ 2 ( t ) are shown in Figure 2 and Figure 3.
Figure 4 and Figure 5, respectively, show the state–response curves corresponding to the time delays of p i j l = p ^ j i r = 0.1 and p i j l = p ^ j i r = 0.5 , i , j , r , l Z 2 , indicating that different time delays affect the convergence rate of the error system.

5. Conclusions

This paper addresses the issue of SGPS for HOBAMNNs with multiple proportional delays. Utilizing the definition of SGPS, we initially derive delay-dependent SGPS criteria for the error dynamical system. Subsequently, a controller gain is provided. Finally, we present illustrative examples to demonstrate the applicability of the conclusions. Compared with previous research, the main contribution of this work lies in the first investigation of SGPS for HOBAMNNs with multiple proportional delays. By directly deriving easily implementable sufficient criteria based on the definition of SGPS, our approach is applicable to a broader class of NN models. In [47], the general decay synchronization concept for the considered network based on ψ -type stability has been given. The general decay synchronization contained polynomial synchronization, exponential synchronization, logarithmic synchronization, and other synchronization as its special cases. We will consider this issue in further research.

Author Contributions

Conceptualization, E.-y.C. and X.Z.; Methodology, E.-y.C., X.Z. and L.Z.; Writing—original draft, E.-y.C., X.Z. and L.Z.; Writing—review & editing, E.-y.C., X.Z. and L.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported in part by the Natural Science Foundation of Heilongjiang Province (No. LH2022F046 and No. YQ2022F015), the Project for the Research Foundation of Young Doctors of Harbin University (No. HUDF2022112) and Harbin Science and Technology Plan Project (No. 2023ZCZJCG045 and No. 2023ZCZJCG046).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Townsend, J.; Chaton, T.; Monteiro, J.M. Extracting relational explanations from deep neural networks: A survey from a neural-symbolic perspective. IEEE Trans. Neural Netw. Learn. Syst. 2020, 31, 3456–3470. [Google Scholar] [CrossRef] [PubMed]
  2. Thangarajan, S.K.; Chokkalingam, A. Integration of optimized neural network and convolutional neural network for automated brain tumor detection. Sens. Rev. 2021, 41, 16–34. [Google Scholar] [CrossRef]
  3. Lee, Y.; Doolen, G.; Chen, H.H.; Sun, G.Z.; Maxwell, T.; Lee, H.Y. Machine learning using a higher order correlation network. Phys. D Nonlinear Phenom. 1986, 22, 276–306. [Google Scholar] [CrossRef]
  4. Chen, Y.; Zhang, X.; Xue, Y. Global exponential synchronization of high-order quaternion Hopfield neural networks with unbounded distributed delays and time-varying discrete delays. Math. Comput. Simul. 2022, 193, 173–189. [Google Scholar] [CrossRef]
  5. Dong, Z.; Wang, X.; Zhang, X.; Hu, M.; Dinh, T.N. Global exponential synchronization of discrete-time high-order switched neural networks and its application to multi-channel audio encryption. Nonlinear Anal. Hybrid Syst. 2023, 47, 101291. [Google Scholar] [CrossRef]
  6. Kosko, B. Adaptive bidirectional associative memories. Appl. Opt. 1987, 26, 4947–4960. [Google Scholar] [CrossRef]
  7. Kosko, B. Bi-directional associative memories. IEEE Trans. Syst. Man Cybern. 1988, 18, 49–60. [Google Scholar] [CrossRef]
  8. Simpson, P.K. Higher-ordered and intraconnected bidirectional associative memories. IEEE Trans. Syst. Man Cybern. Syst. 1990, 20, 637–653. [Google Scholar] [CrossRef]
  9. Cao, J.; Liang, J.; Lam, J. Exponential stability of high-order bidirectional associative memory neural networks with time delays. Phys. D Nonlinear Phenom. 2004, 199, 425–436. [Google Scholar] [CrossRef]
  10. Aouiti, C.; Li, X.; Miaadi, F. A new LMI approach to finite and fixed time stabilization of high-order class of BAM neural networks with time-varying delays. Neural Process. Lett. 2019, 50, 815–838. [Google Scholar] [CrossRef]
  11. Ho, D.W.C.; Liang, J.; Lam, J. Global exponential stability of impulsive high-order BAM neural networks with time-varying delays. Neural Netw. 2006, 19, 1581–1590. [Google Scholar] [CrossRef]
  12. Wang, F.; Liu, M. Global exponential stability of high-order bidirectional associative memory (BAM) neural networks with time delays in leakage terms. Neurocomputing 2016, 177, 515–528. [Google Scholar] [CrossRef]
  13. Yang, W.; Yu, W.; Cao, J.; Alsaadi, F.E.; Hayat, T. Almost automorphic solution for neutral type high-order Hopfield BAM neural networks with time-varying leakage delays on time scales. Neurocomputing 2017, 267, 241–260. [Google Scholar] [CrossRef]
  14. Aouiti, C.; Sakthivel, R.; Touati, F. Global dissipativity of high-order Hopfield bidirectional associative memory neural networks with mixed delays. Neural Comput. Appl. 2020, 32, 10183–10197. [Google Scholar] [CrossRef]
  15. Zu, J.; Yu, Z.; Meng, Y. Global exponential stability of high-order bidirectional associative memory (BAM) neural networks with proportional delays. Neural Process. Lett. 2020, 51, 2531–2549. [Google Scholar] [CrossRef]
  16. Xing, L.; Zhou, L. Polynomial dissipativity of proportional delayed BAM neural networks. Int. J. Biomath. 2020, 13, 2050050. [Google Scholar] [CrossRef]
  17. Zhou, L.; Zhao, Z. Asymptotic stability and polynomial stability of impulsive Cohen–Grossberg neural networks with multi-proportional delays. Neural Process. Lett. 2020, 51, 2607–2627. [Google Scholar] [CrossRef]
  18. Wang, Y.; Yang, X.; Chen, X.; Liu, C. Positivity and semi-global polynomial stability of high-order Cohen–Grossberg BAM neural networks with multiple proportional delays. Inf. Sci. 2025, 689, 121512. [Google Scholar] [CrossRef]
  19. Pecora, L.M.; Carroll, T.L. Synchronization in chaotic system. Phys. Rev. Lett. 1990, 64, 821–824. [Google Scholar] [CrossRef]
  20. Zhou, L. Dissipativity of a class of cellular neural networks with proportional delays. Nonlinear Dyn. 2013, 73, 1895–1903. [Google Scholar] [CrossRef]
  21. Jia, S.; Hu, C.; Yu, J.; Jiang, H. Asymptotical and adaptive synchronization of Cohen-Grossberg neural networks with heterogeneous proportional delays. Neurocomputing 2018, 275, 1449–1455. [Google Scholar] [CrossRef]
  22. Yang, X.; Song, Q.; Cao, J.; Lu, J. Synchronization of Coupled Markovian Reaction-Diffusion Neural Networks with Proportional Delays via Quantized Control. IEEE Trans. Neural Netw. Learn. Syst. 2019, 30, 951–958. [Google Scholar] [CrossRef]
  23. Li, Q.; Zhou, L. Global asymptotic synchronization of inertial memristive Cohen-Grossberg neural networks with proportional delays. Commun. Nonlinear Sci. Numer. Simul. 2023, 123, 107295. [Google Scholar] [CrossRef]
  24. Zhou, L. Delay-dependent exponential synchronization of recurrent neural networks with multiple proportional delays. Neural Process. Lett. 2015, 42, 619–632. [Google Scholar] [CrossRef]
  25. Wan, P.; Sun, D.; Chen, D.; Zhao, M.; Zheng, L. Exponential synchronization of inertial reaction-diffusion coupled neural networks with proportional delay via periodically intermittent control. Neurocomputing 2019, 356, 195–205. [Google Scholar] [CrossRef]
  26. Su, L.; Zhou, L. Exponential synchronization of memristor-based recurrent neural networks with multi-proportional delays. Neural Comput. Appl. 2019, 31, 7907–7920. [Google Scholar] [CrossRef]
  27. Li, L.; Chen, W.; Wu, X. Global Exponential Stability and Synchronization for Novel Complex-Valued Neural Networks With Proportional Delays and Inhibitory Factors. IEEE Trans. Cybern. 2021, 51, 2142–2152. [Google Scholar] [CrossRef]
  28. Zhang, W.; Li, C.; Huang, T.; Huang, J. Finite-time Synchronization of Neural Networks with Multiple Proportional Delays via Non-chattering Control. Int. J. Control Autom. Syst. 2018, 16, 2473–2479. [Google Scholar] [CrossRef]
  29. Xiaolin, X.; Rongqiang, T.; Xinsong, Y. Finite-Time Synchronization of Memristive Neural Networks with Proportional Delay. Neural Process. Lett. 2019, 50, 1139–1152. [Google Scholar]
  30. Yang, W.; Huang, J.; He, X.; Wen, S.; Huang, T. Finite-Time Synchronization of Neural Networks With Proportional Delays for RGB-D Image Protection. IEEE Trans. Neural Netw. Learn. Syst. 2024, 35, 8149–8160. [Google Scholar] [CrossRef]
  31. Han, J.; Zhou, L. Finite-time synchronization of proportional delay memristive competitive neural networks. Neurocomputing 2024, 610, 128612. [Google Scholar] [CrossRef]
  32. Duan, L.; Li, J. Finite-time synchronization for a fully complex-valued BAM inertial neural network with proportional delays via non-reduced order and non-separation approach. Neurocomputing 2025, 611, 128648. [Google Scholar] [CrossRef]
  33. Aouiti, C.; Assali, E.A.; Chérif, F.; Zeglaoui, A. Fixed-time synchronization of competitive neural networks with proportional delays and impulsive effect. Neural Comput. Appl. 2020, 32, 13245–13254. [Google Scholar] [CrossRef]
  34. Duan, L.; Li, J. Fixed-time synchronization of fuzzy neutral-type BAM memristive inertial neural networks with proportional delays. Inf. Sci. 2021, 576, 522–541. [Google Scholar] [CrossRef]
  35. Wan, Y.; Zhou, L. Fixed-time synchronization of discontinuous proportional delay inertial neural networks with uncertain parameters. Inf. Sci. 2024, 678, 120931. [Google Scholar] [CrossRef]
  36. Liu, Y.; Wan, X.; Wu, E.; Yang, X.; Alsaadi, F.E.; Hayat, T. Finite-time synchronization of Markovian neural networks with proportional delays and discontinuous activations. Nonlinear Anal. Model. Control 2018, 23, 515–532. [Google Scholar] [CrossRef]
  37. Wang, W. Finite-time synchronization for a class of fuzzy cellular neural networks with time-varying coefficients and proportional delays. Fuzzy Sets Syst. 2018, 338, 40–49. [Google Scholar] [CrossRef]
  38. Alimi, A.M.; Aouiti, C.; Assali, E.A. Finite-time and fixed-time synchronization of a class of inertial neural networks with multi-proportional delays and its application to secure communication. Neurocomputing 2019, 332, 29–43. [Google Scholar] [CrossRef]
  39. Zhang, W.; Li, C.; Yang, S.; Yang, X. Synchronization criteria for neural networks with proportional delays via quantized control. Nonlinear Dyn. 2018, 94, 541–551. [Google Scholar] [CrossRef]
  40. Kinh, C.T.; Hien, L.V.; Ke, T.D. Power-Rate Synchronization of Fractional-Order Nonautonomous Neural Networks with Heterogeneous Proportional Delays. Neural Process. Lett. 2018, 47, 139–151. [Google Scholar] [CrossRef]
  41. Guan, K. Global power-rate synchronization of chaotic neural networks with proportional delay via impulsive control. Neurocomputing 2018, 283, 256–265. [Google Scholar] [CrossRef]
  42. Zhou, L.; Zhao, Z. Exponential synchronization and polynomial synchronization of recurrent neural networks with and without proportional delays. Neurocomputing 2020, 372, 109–116. [Google Scholar] [CrossRef]
  43. Yao, Z.; Zhang, Z.; Wang, Z.; Lin, C.; Chen, J. Polynomial synchronization of complex-valued inertial neural networks with multi-proportional delays. Commun. Theor. Phys. 2022, 74, 125801. [Google Scholar] [CrossRef]
  44. Zhou, L.; Zhu, Q.; Huang, T. Global Polynomial Synchronization of Proportional Delayed Inertial Neural Networks. IEEE Trans. Syst. Man Cybern. Syst. 2023, 53, 4487–4497. [Google Scholar] [CrossRef]
  45. Zhang, J.; Li, Z.; Cao, J.; Abdel-Aty, M.; Meng, X. Polynomial synchronization of quaternion-valued fuzzy cellular neural networks with proportional delays. Nonlinear Dyn. 2025, 113, 3523–3542. [Google Scholar] [CrossRef]
  46. Wan, Y.; Zhou, L.; Han, J. Global polynomial synchronization of proportional delay memristive neural networks with uncertain parameters and its application to image encryption. Eng. Appl. Artif. Intell. 2025, 147, 110290. [Google Scholar] [CrossRef]
  47. Huang, Y.; Zhao, X. General Decay Synchronization of State and Spatial Diffusion Coupled Delayed Memristive Neural Networks with Reaction-diffusion Terms. Int. J. Control Autom. Syst. 2024, 22, 2313–2326. [Google Scholar] [CrossRef]
Figure 1. The error curves of ϵ ( t ) and ϵ ˜ ( t ) .
Figure 1. The error curves of ϵ ( t ) and ϵ ˜ ( t ) .
Mathematics 13 01512 g001
Figure 2. Synchronization curves of ζ ( t ) and ζ ^ ( t ) .
Figure 2. Synchronization curves of ζ ( t ) and ζ ^ ( t ) .
Mathematics 13 01512 g002
Figure 3. Synchronization curves of ϑ ( t ) and ϑ ^ ( t ) .
Figure 3. Synchronization curves of ϑ ( t ) and ϑ ^ ( t ) .
Mathematics 13 01512 g003
Figure 4. The error curves of ϵ ( t ) and ϵ ˜ ( t ) when p i j l = p ^ j i r = 0.1 , i , j , r , l Z 2 .
Figure 4. The error curves of ϵ ( t ) and ϵ ˜ ( t ) when p i j l = p ^ j i r = 0.1 , i , j , r , l Z 2 .
Mathematics 13 01512 g004
Figure 5. The error curves of ϵ ( t ) and ϵ ˜ ( t ) when p i j l = p ^ j i r = 0.5 , i , j , r , l Z 2 .
Figure 5. The error curves of ϵ ( t ) and ϵ ˜ ( t ) when p i j l = p ^ j i r = 0.5 , i , j , r , l Z 2 .
Mathematics 13 01512 g005
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Cong, E.-y.; Zhang, X.; Zhu, L. Semi-Global Polynomial Synchronization of High-Order Multiple Proportional-Delay BAM Neural Networks. Mathematics 2025, 13, 1512. https://doi.org/10.3390/math13091512

AMA Style

Cong E-y, Zhang X, Zhu L. Semi-Global Polynomial Synchronization of High-Order Multiple Proportional-Delay BAM Neural Networks. Mathematics. 2025; 13(9):1512. https://doi.org/10.3390/math13091512

Chicago/Turabian Style

Cong, Er-yong, Xian Zhang, and Li Zhu. 2025. "Semi-Global Polynomial Synchronization of High-Order Multiple Proportional-Delay BAM Neural Networks" Mathematics 13, no. 9: 1512. https://doi.org/10.3390/math13091512

APA Style

Cong, E.-y., Zhang, X., & Zhu, L. (2025). Semi-Global Polynomial Synchronization of High-Order Multiple Proportional-Delay BAM Neural Networks. Mathematics, 13(9), 1512. https://doi.org/10.3390/math13091512

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Article metric data becomes available approximately 24 hours after publication online.
Back to TopTop