Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

Convex-structured covariance estimation via the entropy loss under the majorization-minimization algorithm framework

  • Received: 31 January 2024 Revised: 07 April 2024 Accepted: 12 April 2024 Published: 18 April 2024
  • MSC : 62J10

  • We estimated convex-structured covariance/correlation matrices by minimizing the entropy loss corresponding to the given matrix. We first considered the estimation of the Weighted sum of known Rank-one matrices with unknown Weights (W-Rank1-W) structural covariance matrices, which appeared commonly in array signal processing tasks, e.g., direction-of-arrival (DOA) estimation. The associated minimization problem is convex and can be solved using the primal-dual interior-point algorithm. However, the objective functions (the entropy loss function) can be bounded above by a sequence of separable functions—we proposed a novel estimation algorithm based on this property under the Majorization-Minimization (MM) algorithmic framework. The proposed MM algorithm exhibited very low computational complexity in each iteration, and its convergence was demonstrated theoretically. Subsequently, we focused on the estimation of Toeplitz autocorrelation matrices, which appeared frequently in time-series analysis. In particular, we considered cases in which the autocorrelation coefficient decreased as the time lag increased. We transformed the Toeplitz structure into a W-Rank1-W structure via special variable substitution, and proposed an MM algorithm similar to that for the W-Rank1-W covariance estimation. However, each MM iteration involved a second-order cone programming SOCP problem that must be resolved. Our numerical experiments demonstrated the high computational efficiency and satisfactory estimation accuracy of the proposed MM algorithms in DOA and autocorrelation matrix estimation.

    Citation: Chen Chen, Xiangbing Chen, Yi Ai. Convex-structured covariance estimation via the entropy loss under the majorization-minimization algorithm framework[J]. AIMS Mathematics, 2024, 9(6): 14253-14273. doi: 10.3934/math.2024692

    Related Papers:

    [1] Ibrahim Al-Dayel, Sharief Deshmukh, Olga Belova . Characterizing non-totally geodesic spheres in a unit sphere. AIMS Mathematics, 2023, 8(9): 21359-21370. doi: 10.3934/math.20231088
    [2] Mohammed Guediri, Sharief Deshmukh . Hypersurfaces in a Euclidean space with a Killing vector field. AIMS Mathematics, 2024, 9(1): 1899-1910. doi: 10.3934/math.2024093
    [3] Hanan Alohali, Sharief Deshmukh . Some generic hypersurfaces in a Euclidean space. AIMS Mathematics, 2024, 9(6): 15008-15023. doi: 10.3934/math.2024727
    [4] Yanlin Li, Nasser Bin Turki, Sharief Deshmukh, Olga Belova . Euclidean hypersurfaces isometric to spheres. AIMS Mathematics, 2024, 9(10): 28306-28319. doi: 10.3934/math.20241373
    [5] Sharief Deshmukh, Mohammed Guediri . Some new characterizations of spheres and Euclidean spaces using conformal vector fields. AIMS Mathematics, 2024, 9(10): 28765-28777. doi: 10.3934/math.20241395
    [6] Sudhakar Kumar Chaubey, Meraj Ali Khan, Amna Salim Rashid Al Kaabi . N(κ)-paracontact metric manifolds admitting the Fischer-Marsden conjecture. AIMS Mathematics, 2024, 9(1): 2232-2243. doi: 10.3934/math.2024111
    [7] Sharief Deshmukh, Mohammed Guediri . Characterizations of Euclidean spheres. AIMS Mathematics, 2021, 6(7): 7733-7740. doi: 10.3934/math.2021449
    [8] Amira Ishan . On concurrent vector fields on Riemannian manifolds. AIMS Mathematics, 2023, 8(10): 25097-25103. doi: 10.3934/math.20231281
    [9] Yaning Wang, Yingdong Zhang . Jacobi-type vector fields on H3 and R3. AIMS Mathematics, 2021, 6(11): 11894-11903. doi: 10.3934/math.2021690
    [10] Amira Ishan, Sharief Deshmukh . Torse-forming vector fields on m -spheres. AIMS Mathematics, 2022, 7(2): 3056-3066. doi: 10.3934/math.2022169
  • We estimated convex-structured covariance/correlation matrices by minimizing the entropy loss corresponding to the given matrix. We first considered the estimation of the Weighted sum of known Rank-one matrices with unknown Weights (W-Rank1-W) structural covariance matrices, which appeared commonly in array signal processing tasks, e.g., direction-of-arrival (DOA) estimation. The associated minimization problem is convex and can be solved using the primal-dual interior-point algorithm. However, the objective functions (the entropy loss function) can be bounded above by a sequence of separable functions—we proposed a novel estimation algorithm based on this property under the Majorization-Minimization (MM) algorithmic framework. The proposed MM algorithm exhibited very low computational complexity in each iteration, and its convergence was demonstrated theoretically. Subsequently, we focused on the estimation of Toeplitz autocorrelation matrices, which appeared frequently in time-series analysis. In particular, we considered cases in which the autocorrelation coefficient decreased as the time lag increased. We transformed the Toeplitz structure into a W-Rank1-W structure via special variable substitution, and proposed an MM algorithm similar to that for the W-Rank1-W covariance estimation. However, each MM iteration involved a second-order cone programming SOCP problem that must be resolved. Our numerical experiments demonstrated the high computational efficiency and satisfactory estimation accuracy of the proposed MM algorithms in DOA and autocorrelation matrix estimation.



    The properties of differential inequalities are widely used in the study of dynamical systems and functional differential equations. In 1966, Halanay [1] first proved the following theorem:

    Theorem 1.1. Let z(t) be any nonnegative solution of

    z(t)az(t)+bsuptτstz(s),tt0,

    and a>b>0, then there exist two positive constants α,β>0 such that

    z(t)αeβ(tt0)fortt0.

    The above inequality is called the Halanay inequality. Due to wide applications in differential dynamic systems for Halanay inequality, many results have been obtained for Halanay inequality and its generalizations; see [2,3,4,5,6,7,8,9,10] and related references.

    In this paper, we focus on the study of differential inequalities (including Halanay inequalities) with delays on time scales. Let's briefly review the research on the above aspects. B. Ou et al. [11] proved the following theorem:

    Theorem 1.2. Let z(t) be any nonnegative solution of

    zΔ(t)a(t)z(t)+b(t)suptτ(t)stz(s)+c(t)0K(t,s)z(ts)Δs,tt0,z(s)=ϕ(s),s(,t0]T,

    where τ(t),a(t),b(t), and c(t) are rd-continuous and bounded functions, and K(t,s) is nonnegative and continuous. If the following conditions are satisfied:

    (1) 0K(t,s)eA(t,ts)Δs is uniformly bounded for tT.

    (2) There exist t1>t0,T>0 and ρ>0 such that for each nN,

    t1+nT+Tt1+nT[a(t)b+(t)c+(t)0K(t,s)Δs]>ρ,

    where A=suptT{|a(t)|,|b(t)|,|c(t)|,a(t)1μ(t)a(t)}. Then for each τ<1Aln(1B+ρAT),B=suptT0K(t,s)(eA(t,ts)1)Δs<ρAT, z(t) is exponentially stable, i.e., there exist α,β>0 (which may depend on the initial value), and such that

    z(t)αeβ(t,t0)fort[t0,).

    After that, they generalized the above results to the Halanay inequality on time scales with unbounded coefficients; see [12,13]. We can find more results for Halanay inequality on time scales in [14,15]. We have found that the methods used to study the Halanay inequality in existing literatures are mainly mathematical analysis methods, and we only found reference most [2] to study the Halanay inequality using the fixed point theorem. The fixed point theorem is one of the important methods for studying the main branches of mathematical problems, especially in the study of differential equations and dynamical systems. Researchers have obtained a large number of research results using the fixed point theorem, see [16,17,18,19,20]. In this paper, we will consider some delay inequalities by using the fixed point theorem. Our results improve and extend the existing results for Halanay inequality and its generalizations. The major contributions of this work are listed as follows:

    (1) Most existing results require the solutions and coefficients of Halanay inequalities to be non-negative; see [3,4,5,11,12]. In this paper, we will remove these limitations.

    (2) We develop the research scope of Halanay inequality. Specifically, we study Halanay inequality in more general cases, and the results obtained have wider applicability.

    (3) The research methods for the Halanay inequality on time scales are mostly mathematical analysis methods and time scale theory, see [11,12,13,14]. The research method of this article is the fixed point theorem. We obtained the properties of delay inequalities under broader conditions.

    The contents of this paper are organized as follows: Section 2 gives some preliminaries. Section 3 gives asymptotic behavior for differential inequalities with time-varying delay. Section 4 gives asymptotic behavior for differential inequalities with time-varying delay and distributed delay. In Section 5, some numerical examples are presented to illustrate the validity of the theoretical results. Finally, we conclude this paper.

    A time scale T is a closed subset of R. The means for the forward jump operator σ, backward jump operator ρ, regressive rd-continuous functions' set R and positive regressive rd-continuous functions' set R+ seen in [21]. The interval [a,b]T means [a,b]T. The intervals [a,b)T,(a,b)T, and (a,b]T are defined similarly. Crd([t0,)T represents the set of all rd-continuous functions on [t0,)T. The exponential function on T is defined by eα(t,s)=exp(tsξμ(r)(α(r))Δr), where

    ξμ(r)(α(r))={1μ(r)Log(1+μ(r)α(r)),μ(r)>0,α(r),μ(r)=0.

    Lemma 2.1. [21] Let α,βR. Then

    [1] e0(t,s)1 and eα(t,t)1;

    [2] eα(ρ(t),s)=(1μ(t)α(t))eα(t,s);

    [3] eα(t,s)=1eα(s,t)=eα(s,t), where α(t)=α(t)1+μ(t)α(t).

    [4] eα(t,s)eα(s,r)=eα(t,r);

    [5] eα(t,s)eβ(t,s)=eαβ(t,s).

    Lemma 2.2. [21] Suppose that yΔ=p(t)y+f(t) is regressive on a time scale T. Let t0T and y0R. The unique solution to the initial value problem

    yΔ=p(t)y+f(t),y(t0)=y0

    is given by

    y(t)=ep(t,t0)y0+tt0ep(t,σ(τ))f(τ)Δτ.

    Lemma 2.3. [21] Suppose that yΔ=p(t)y+f(t) is regressive on a time scale T. Let t0T and y0R. The unique solution of the initial value problem

    yΔ=p(t)yσ+f(t),y(t0)=y0

    is given by

    y(t)=ep(t,t0)y0+tt0ep(t,τ)f(τ)Δτ.

    Lemma 2.4. [22] For a nonnegative function ρ with ρR+, we have

    1tsρ(u)Δueρ(t,s)exp{tsρ(u)Δu}forallts.

    For a nonnegative function ρ with ρR+, we have

    1+tsρ(u)Δueρ(t,s)exp{tsρ(u)Δu}forallts.

    Remark 2.1. For ρR+ and ρ(r)>0 for r[s,t]T, we have

    eρ(t,r)eρ(t,s)andeρ(a,b)<1forsa<bt.

    An additive time scale is a time scale that is closed under addition. There exist many time scales that are not additive; we need the notion of shift operators to avoid additivity assumption on the time scale. In this paper, we will define the delay terms as using shift operators.

    Definition 2.1. [23] Let T be a non-empty subset of the time scale T and t0T a fixed number such that there exist operators δ±:[t0,)T×T satisfying the following properties:

    (1) The functions δ± are strictly increasing with respect to their second arguments;

    (2) if (T1,u),(T2,u)D with T1>T2, then δ(T1,u)<δ(T2,u); if (T1,u),(T2,u)D+ with T1>T2, then δ+(T1,u)>δ+(T2,u);

    (3) if t[t0,)T, then (t,t0)D+ and δ+(t,t0)=t; if tT, then (t,t0)D+ and δ+(t,t0)=t;

    (4) if (s,t)D±, then (s,δ±(s,t))D and δ(s,δ±(s,t))=t;

    (5) if (s,t)D± and (s,δ±(s,t))D, then (s,δ(u,t))D± and δ(u,δ±(s,t))=δ±(s,δ(u,t)).

    Then the operators δ and δ+ associated with t0T (called the initial point) are said to be backward and forward shift operators on the set T, respectively. For more details about shift operators and their applications, see [24,25,26,27].

    Consider the following generalized Halanay's inequality with time-varying delay:

    xΔ(t)a(t)x(t)+b(t)sup0sτ(t)x(δ(s,t)),tt0,x(s)=x0,s[δ(ˆτ,t0),t0]T, (3.1)

    where δ(s,t) is backward shift operator, tT,x0R,τ(t)0 is rd-continuous and bounded function with τ(t)ˆτ,ˆτ is a constant, a(t) and b(t) are rd-continuous on [t0,)T.

    Theorem 3.1. Assume that x(t) satisfies (3.1), a(t)0 with aR+, and there exists a constant γ1>0 such that, for tt0,

    (ⅰ)

    supv[t0,t]Tvt0exp{vσ(u)a(s)Δs}|b(u)|Δuγ1<1;

    (ⅱ) exp{tt0a(u)Δu} as t.

    Then x(t)0 as t.

    Proof. Define the following delay dynamic system:

    xΔ(t)=a(t)x(t)+b(t)sup0sτ(t)x(δ(s,t)),tt0,x(s)=x0,s[δ(ˆτ,t0),t0]T. (3.2)

    From (3.2) and Lemma 2.2, we obtain

    x(t)=ea(t,t0)x0+tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu. (3.3)

    Define the space Ω1 by

    Ω1={x:xCrd([t0,)T,R),x(t)0ast}

    with the norm ||x||=supt[t0,)T|x(t)|. Then Ω1 is a Banach space. Define the operator Γ1:Ω1Ω1 by

    (Γ1x)(t)=ea(t,t0)x0+tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu,tt0,(Γ1x)(s)=x0,s[δ(ˆτ,t0),t0]T. (3.4)

    Obviously, Γ1 is rd-continuous on [t0,)T. We first show that Γ1Ω1Ω1. From Lemma 2.4 and condition (ii), we have

    |ea(t,t0)x0|exp{tt0a(u)Δu}|x0|0ast. (3.5)

    Since x(t)0 as t, for any ε>0, there exists T1>0 such that

    |x(t)|<εfortT1. (3.6)

    From Lemma 2.4 and (3.6), we get

    |tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu|=|T1t0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu+tT1ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu|sup0sτ(t),t0uT1|x(δ(s,u))|T1t0exp{tσ(u)a(v)Δv}|b(u)|Δu+εtT1exp{tσ(u)a(v)Δv}|b(u)|Δu. (3.7)

    From (3.7) and condition (ⅱ), there exists T2T1, for any tT2 and ε>0 such that

    sup0sτ(t),t0uT1|x(δ(s,u))|T1t0exp{tσ(u)a(v)Δv}|b(u)|Δu<ε

    and

    tT1exp{tσ(u)a(v)Δv}|b(u)|Δu<ε.

    Thus,

    |tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu|<εast. (3.8)

    Hence, in view of (3.4), (3.5), and (3.8), we obtain that |(Γ1x)(t)|0 as t and Γ1(Ω1)Ω1.

    For x,yΩ1, from condition (ⅰ), we have

    supv[t0,t]T|(Γx)(v)(Γy)(v)|supv[t0,t]T|x(v)y(v)|×supv[0,t]Tvt0ea(v,σ(u))|b(u)|Δusupv[t0,t]T|x(v)y(v)|×supv[0,t]Tvt0exp{vσ(u)a(s)Δs}|b(u)|Δuγ1supv[t0,t]T|x(v)y(v)|.

    Therefore, we obtain that Γ1 is a contraction mapping and has a unique fixed point x on Ω1, which is a solution of (3.2) with the initial condition x(s)=x0,s[δ(ˆτ,t0),t0]T.

    Next, we show that the zero solution of (3.1) is asymptotic stable. If x(t) is a solution of (3.2) with the initial condition x(s)=x0,s[δ(ˆτ,t0),t0]T. Since x(t)Ω1, then x(t) is bounded on tt0. From (3.5) and (3.8), for any ε>0, we have

    |x(t)|=|ea(t,t0)x0+tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu||ea(t,t0)x0|+|tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu|0ast.

    Thus, system (3.2) is asymptotically stable which implies system (3.1) is asymptotically stable. The proof is complete.

    Theorem 3.2. Assume that x(t) satisfies (3.1). There exists f(t)0 with fR+ and there exists constant γ2>0 such that, for tt0,

    (ⅰ)

    supv[t0,t]Tvt0exp{vσ(u)a(s)Δs}(|f(u)a(u)|+|b(u)|)Δuγ2<1;

    (ⅱ) exp{tt0f(u)Δu} as t.

    Then x(t)0 as t.

    Proof. From (3.2) and Lemma 2.2, we obtain

    x(t)=ef(t,t0)x0+tt0ef(t,σ(u))[f(u)a(u)]Δu+tt0ef(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu. (3.9)

    Define a space Ω2 by

    Ω2={x:xCrd([t0,)T,R),x(t)0ast}

    with the norm ||x||=supt[t0,)T|x(t)|. Then Ω2 is a Banach space. Define the operator Γ2:Ω1Ω2 by

    (Γ2x)(t)=ef(t,t0)x0+tt0ef(t,σ(u))[f(u)a(u)]Δu+tt0ef(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu,tt0,(Γ2x)(s)=x0,s[δ(ˆτ,t0),t0]T. (3.10)

    Obviously, Γ2 is rd-continuous on [t0,)T. Similar to the proofs of (3.5) and (3.8), using Lemma 2.4 and condition (ii), we have

    |ef(t,t0)x0|exp{tt0f(u)Δu}|x0|0ast (3.11)

    and

    |tt0ea(t,σ(u))(f(u)a(u))Δu|+|tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu|<εast. (3.12)

    Hence, in view of (3.10)–(3.12), we obtain that |(Γ2x)(t)|0 as t and Γ2(Ω2)Ω2.

    For x,yΩ2, from condition (ⅰ), we have

    supv[t0,t]T|(Γ2x)(v)(Γ2y)(v)|supv[t0,t]T|x(v)y(v)|×supv[0,t]Tvt0ea(v,σ(u))(|f(u)a(u)|+|b(u)|)Δusupv[t0,t]T|x(v)y(v)|×supv[0,t]Tvt0exp{vσ(u)a(s)Δs}(|f(u)a(u)|+|b(u)|)Δuγ2supv[t0,t]T|x(v)y(v)|.

    Therefore, we obtain that Γ2 is a contraction mapping and has a unique fixed point x on Ω2, which is a solution of (3.2) with the initial condition x(s)=x0,s[δ(ˆτ,t0),t0]T. Since x(t)Ω2, then x(t) is bounded on tt0. From (3.11) and (3.12), for any ε>0, we have

    |x(t)|=|ea(t,t0)x0+tt0ea(t,σ(u))[f(u)a(u)]Δu+tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu||ea(t,t0)x0|+|tt0ea(t,σ(u))[f(u)a(u)]Δu|+|tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu|0ast.

    Thus, system (3.2) is asymptotically stable which implies system (3.1) is asymptotically stable. The proof is complete.

    Remark 3.1. Theorem 3.2 removes the condition of non-negativity of coefficient a(t); therefore, the results of Theorem 3.2 improve the corresponding ones of Theorem 3.1.

    Consider the following generalized Halanay's inequality with time-varying delay:

    xΔ(t)a(t)x(σ(t))+b(t)sup0sτ(t)x(δ(s,t)),tt0,x(s)=x0,s[δ(ˆτ,t0),t0]T, (3.13)

    where δ(s,t) is backward shift operator, tT,x0R,τ(t)0 is rd-continuous and bounded function with τ(t)ˆτ,ˆτ is a constant, a(t) and b(t) are rd-continuous on [t0,)T. Based on Lemma 2.3 and Theorems 3.1 and 3.2, we have the following two corollaries:

    Corollary 3.1. Assume that x(t) satisfies (3.13), a(t)0 with aR+, and there exists a constant γ3>0 such that, for tt0,

    (ⅰ)

    supv[t0,t]Tvt0exp{vua(s)Δs}|b(u)|Δuγ3<1;

    (ⅱ) exp{tt0a(u)Δu} as t.

    Then x(t)0 as t.

    Corollary 3.2. Assume that x(t) satisfies (3.13). There exists f(t)0 with fR+ and there exists a constant γ4>0 such that, for tt0,

    (ⅰ)

    supv[t0,t]Tvt0exp{vua(s)Δs}(|f(u)a(u)|+|b(u)|)Δuγ4<1;

    (ⅱ) exp{tt0f(u)Δu} as t.

    Then x(t)0 as t.

    Consider the following generalization of Halanay's inequality with mixed delays:

    xΔ(t)a(t)x(t)+b(t)sup0sτ(t)x(δ(s,t))+c(t)0K(s)x(δ(s,t))Δs,tt0,x(s)=x0,s(,t0]T, (4.1)

    where δ(s,t) is backward shift operator, tT,x0R,τ(t)0 is rd-continuous and bounded function with τ(t)ˆτ,ˆτ is a constant, a(t),b(t), and c(t) are rd-continuous on [t0,)T, and K(t) is rd-continuous on [0,)T.

    Theorem 4.1. Assume that x(t) satisfies (4.1), a(t)0 with aR+,0|K(s)|Δs< and there exists a constant γ5>0 such that, for tt0,

    (ⅰ)

    supv[t0,t]Tvt0exp{vσ(u)a(s)Δs}(|b(u)+|c(u)|0|K(s)|Δs)Δuγ5<1;

    (ⅱ) exp{tt0a(u)Δu} as t.

    Then x(t)0 as t.

    Proof. Define the following delay dynamic system:

    xΔ(t)=a(t)x(t)+b(t)sup0sτ(t)x(δ(s,t))+c(t)0K(s)x(δ(s,t))Δs,tt0,x(s)=x0,s(,t0]T. (4.2)

    From (4.2) and Lemma 2.2, we obtain

    x(t)=ea(t,t0)x0+tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu+tt0ea(t,σ(u))c(u)0K(s)x(δ(s,u))ΔsΔu. (4.3)

    Define a space Ω3 by

    Ω3={x:xCrd([t0,)T,R),x(t)0ast}

    with the norm ||x||=supt[t0,)T|x(t)|. Then Ω3 is a Banach space. Define the operator Γ3:Ω3Ω3 by

    (Γ3x)(t)=ea(t,t0)x0+tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu+tt0ea(t,σ(u))c(u)0K(s)x(δ(s,u))ΔsΔu,tt0,(Γ3x)(s)=x0,s(,t0]T. (4.4)

    Obviously, Γ3 is rd-continuous on [t0,)T. Similar to the proofs of (3.5) and (3.8), using Lemma 2.4 and condition (ii), we have

    |ea(t,t0)x0|exp{tt0a(u)Δu}|x0|0ast (4.5)

    and

    |tt0ea(t,σ(u))c(u)0K(s)x(δ(s,u))ΔsΔu|+|tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu|<εast. (4.6)

    Hence, in view of (4.4)–(4.6), we obtain that |(Γ3x)(t)|0 as t and Γ3(Ω3)Ω3.

    For x,yΩ2, from condition (ⅰ), we have

    supv[t0,t]T|(Γ2x)(v)(Γ2y)(v)|supv[t0,t]T|x(v)y(v)|×supv[0,t]Tvt0ea(v,σ(u))(|b(u)|+|c(u)|0|K(s)|Δs)Δusupv[t0,t]T|x(v)y(v)|×supv[0,t]Tvt0exp{vσ(u)a(s)Δs}(|b(u)|+|c(u)|0|K(s)|Δs)Δuγ5supv[t0,t]T|x(v)y(v)|.

    Therefore, we obtain that Γ3 is a contraction mapping and has a unique fixed point x on Ω3, which is a solution of (4.2) with the initial condition x(s)=x0,s(,t0]T. Since x(t)Ω3, then x(t) is bounded on tt0. From (4.5) and (4.6), for any ε>0, we have

    |x(t)|=|ea(t,t0)x0+tt0ea(t,σ(u))c(u)0K(s)x(δ(s,u))ΔsΔu+tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu||ea(t,t0)x0|+|tt0ea(t,σ(u))c(u)0K(s)x(δ(s,u))ΔsΔu|+|tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu|0ast.

    Thus, system (4.2) is asymptotically stable which implies system (4.1) is asymptotically stable. The proof is complete.

    In order to remove the nonnegative limitation of coefficient a(t) in Theorem 4.1, we provide the following theorem:

    Theorem 4.2. Assume that x(t) satisfies (4.1). There exists f(t)0 with fR+ and there exists constant γ6>0 such that, for tt0,

    (ⅰ)

    supv[t0,t]Tvt0exp{vσ(u)a(s)Δs}(|f(u)a(u)|+|b(u)|+|c(u)|0|K(s)|Δs)Δuγ6<1;

    (ⅱ) exp{tt0f(u)Δu} as t.

    Then x(t)0 as t.

    The proof of Theorem 4.2 is the same as that of Theorem 3.2; we omit it. Furthermore, consider the following generalized Halanay's inequality with mixed delays:

    xΔ(t)a(t)x(σ(t))+b(t)sup0sτ(t)x(δ(s,t))+c(t)0K(s)x(δ(s,t))Δs,tt0,x(s)=x0,s(,t0]T, (4.7)

    where δ(s,t) is backward shift operator, tT,x0R,τ(t)0 is rd-continuous and bounded function with τ(t)ˆτ,ˆτ is a constant, a(t),b(t), and c(t) are rd-continuous on [t0,)T, and K(t) is rd-continuous on [0,)T. Based on Lemma 2.3 and Theorems 4.1 and 4.2, we have the following two corollaries.

    Corollary 4.1. Assume that x(t) satisfies (4.7), a(t)0 with aR+, and there exists a constant γ7>0 such that, for tt0,

    (ⅰ)

    supv[t0,t]Tvt0exp{vua(s)Δs}(|b(u)+|c(u)|0|K(s)|Δs)Δuγ7<1;

    (ⅱ) exp{tt0a(u)Δu} as t.

    Then x(t)0 as t.

    Corollary 4.2. Assume that x(t) satisfies (4.7). There exists f(t)0 with fR+ and there exists constant γ8>0 such that, for tt0,

    (ⅰ)

    supv[t0,t]Tvt0exp{vua(s)Δs}(|f(u)a(u)|+|b(u)|+|c(u)|0|K(s)|Δs)Δuγ8<1;

    (ⅱ) exp{tt0f(u)Δu} as t.

    Then x(t)0 as t.

    Remark 4.1. In this paper, we mainly use the Banach contraction mapping principle to study the asymptotic stability of the trajectories governed by some delay differential inequalities on time scales. In fact, we can use Schauder's fixed point theorem to establish the existence of at least one solution for the considered systems (see [28]); we can also use Leggett Williams fixed point theorem to investigate the existence of three solutions to considered systems, see [29]. We hope that more results from systems (3.1) and (4.1) can be obtained in future work.

    Remark 4.2. We give the advantages of this paper as follows:

    (1) Since many time scales that are not additive, we define the delay terms as using shift operators.

    (2) We extend the research scope and develop research methods for Halanay inequality.

    (3) The research method of this article can study various types of Halanay inequalities, such as Halanay inequality with impulsive terms and Halanay inequality with stochastic terms.

    Example 5.1. When T=Z, consider the following system:

    Δx(k)a(k)x(k)+b(k)sup0sτ(k)x(ks),k0,kZ, (5.1)

    where

    Δx(k)=x(k+1)x(k),a(k)=10.5sin(2k+1.5),b(k)=0.2k+1,τ(k)=30.5cosk.

    Choosing γ1=0.26<1, we have

    supv[0,t]Zv0exp{vσ(u)a(s)Δs}|b(u)|Δu<0.26<1

    and exp{t0a(u)Δu} as t.

    One can see that all conditions of Theorem 3.1 hold. Hence, system (5.1) is asymptotically stable. Figure 1 shows the trajectory of the solution to the system (5.1).

    Figure 1.  The state's trajectory of the system (5.1).

    Example 5.2. When T=Z, consider the following system:

    Δx(k)a(k)x(k)+b(k)sup0sτ(k)x(ks)+c(k)i=0K(i)x(ki),k0,kZ, (5.2)

    where

    Δx(k)=x(k+1)x(k),a(k)=30.2sin(3k+0.5),b(k)=0.4k+1,
    c(k)=(116)k+1,τ(k)=4cosk,K(i)=0.6i+1.

    Choosing γ2=0.86, we have

    supv[0,t]Zv0exp{vσ(u)a(s)Δs}(|b(u)+|c(u)|0|K(s)|Δs)Δu<0.86<1

    and exp{t0a(u)Δu} as t.

    One can see that all conditions of Theorem 4.1 hold. Hence, system (5.2) is asymptotically stable. Figure 2 shows the trajectory of the solution to the system (5.2).

    Figure 2.  The state's trajectory of the system (5.2).

    In this work, some novel asymptotical stability results for delay differential inequalities on time scales have been derived by using time scale theory and the fixed point theorem. Our results do not require the system coefficients to be non-negative but extend the corresponding results of [7,8,9]. It should be pointed out that the use of the fixed point theorem makes the proof process easier to understand. At last, two examples with numerical simulations have been presented to illustrate the effectiveness of our results. In the future, we will study delay differential inequalities with a neutral-type operator on time scales.

    Bingxian Wang: Writing-original draft preparation, Writing-review and editing; Mei Xu: Formal analysis, Methodology. All authors have read and agreed to the published version of the manuscript.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors would like to thank the referees for their very professional comments and helpful suggestions.

    The authors confirm that they have no conflict of interest in this paper.



    [1] S. Haykin, J. Litva, T. Shepherd, Radar array processing, Heidelberg: Springer-Verlag, 1993. https://doi.org/10.1007/978-3-642-77347-1
    [2] Z. Yang, J. Li, P. Stoica, L. Xie, Sparse methods for direction-of-arrival estimation, In: Academic press library in signal processing, volume 7: array, radar and communications engineering, London: Academic Press, 2018,509–581. https://doi.org/10.1016/B978-0-12-811887-0.00011-0
    [3] X. Wu, X. Yang, X. Jia, F. Tian, A gridless DOA estimation method based on convolutional neural network with Toeplitz prior, IEEE Signal Proc. Lett., 29 (2022), 1247–1251. https://doi.org/10.1109/LSP.2022.3176211 doi: 10.1109/LSP.2022.3176211
    [4] J. Hamilton, Time series analysis, Princeton: Princeton University Press, 1994.
    [5] T. Cai, Z. Ren, H. Zhou, Estimating structured high-dimensional covariance and precision matrices: optimal rates and adaptive estimation, Electron. J. Stat., 10 (2016), 1–59. https://doi.org/10.1214/15-EJS1081 doi: 10.1214/15-EJS1081
    [6] Y. Sun, P. Babu, D. Palomar, Robust estimation of structured covariance matrix for heavy-tailed elliptical distributions, IEEE T. Signal Proces., 64 (2016), 3576–3590. https://doi.org/10.1109/TSP.2016.2546222 doi: 10.1109/TSP.2016.2546222
    [7] A. Mieldzioc, M. Mokrzycka, A. Sawikowska, Covariance regularization for metabolomic data on the drought resistance of barley, Biometrical Letters, 56 (2019), 165–181. https://doi.org/10.2478/bile-2019-0010 doi: 10.2478/bile-2019-0010
    [8] K. Filipiak, D. Klein, A. Markiewicz, M. Mokrzycka, Approximation with a kronecker product structure with one component as compound symmetry or autoregression via entropy loss function, Linear Algebra Appl., 610 (2021), 625–646. https://doi.org/10.1016/j.laa.2020.10.013 doi: 10.1016/j.laa.2020.10.013
    [9] D. Ramírez, G. Vazquez-Vilar, R. López-Valcarce, J. Vía, I. Santamaría, Detection of rank-p signals in cognitive radionetworks with uncalibrated multiple antennas, IEEE T. Signal Proces., 59 (2011), 3764–3774. https://doi.org/10.1109/TSP.2011.2146779 doi: 10.1109/TSP.2011.2146779
    [10] O. Besson, Adaptive detection of gaussian rank-one signalsusing adaptively whitened data and rao, gradient and durbin tests, IEEE Signal Proc. Lett., 30 (2023), 399–402. https://doi.org/10.1109/LSP.2023.3265802 doi: 10.1109/LSP.2023.3265802
    [11] P. Stoica, P. Babu, J. Li, SPICE: a sparse covariance-based estimation method for array processing, IEEE T. Signal Proces., 59 (2011), 629–638. https://doi.org/10.1109/TSP.2010.2090525 doi: 10.1109/TSP.2010.2090525
    [12] P. Stoica, P. Babu, SPICE and LIKES: two hyperparameter-free methods for sparse-parameter estimation, Signal Process., 92 (2012), 1580–1590. https://doi.org/10.1016/j.sigpro.2011.11.010 doi: 10.1016/j.sigpro.2011.11.010
    [13] C. Chen, J. Zhou, M. Tang, Direction of arrival estimation in elliptical models via sparse penalized likelihood approach, Sensors, 19 (2019), 2356. https://doi.org/10.3390/s19102356 doi: 10.3390/s19102356
    [14] S. Kullback, R. Leibler, On information and sufficiency, Ann. Math. Statist., 22 (1951), 79–86. https://doi.org/10.1214/aoms/1177729694 doi: 10.1214/aoms/1177729694
    [15] Y. Sun, P. Babu, D. Palomar, Majorization-minimization algorithms in signal processing, communications, and machine learning, IEEE T. Signal Proces., 65 (2017), 794–816. https://doi.org/10.1109/TSP.2016.2601299 doi: 10.1109/TSP.2016.2601299
    [16] T. Cai, Z. Ren, H. Zhou, Optimal rates of convergence for estimating toeplitz covariance matrices, Probab. Theory Relat. Fields, 156 (2013), 101–143. https://doi.org/10.1007/s00440-012-0422-7 doi: 10.1007/s00440-012-0422-7
    [17] H. Li, P. Stoica, J. Li, Computationally efficient maximum likelihood estimation of structured covariance matrices, IEEE T. Signal Proces., 47 (1999), 1314–1323. https://doi.org/10.1109/78.757219 doi: 10.1109/78.757219
    [18] K. Filipiak, A. Markiewicz, A. Mieldzioc, A. Sawikowska, On projection of a positive definite matrix on a cone of nonnegative definite Toeplitz matrices, Electron. J. Linear Al., 33 (2018), 74–82. https://doi.org/10.13001/1081-3810.3750 doi: 10.13001/1081-3810.3750
    [19] L. Lin, N. Higham, J. Pan, Covariance structure regularization via entropy loss function, Comput. Stat. Data Anal., 72 (2014), 315–327. https://doi.org/10.1016/j.csda.2013.10.004 doi: 10.1016/j.csda.2013.10.004
    [20] C. Chen, J. Zhou, J. Pan, Correlation structure regularization via entropy loss function for high-dimension and low-sample-size data, Commun. Stat.-Simul. Comput., 50 (2021), 993–1008. https://doi.org/10.1080/03610918.2019.1571607 doi: 10.1080/03610918.2019.1571607
    [21] Y. Yang, J. Zhou, J. Pan, Estimation and optimal structure selection of high-dimensional toeplitz covariance matrix, J. Multivariate Anal., 184 (2021), 104739. https://doi.org/10.1016/j.jmva.2021.104739 doi: 10.1016/j.jmva.2021.104739
    [22] C. Stein, Lectures on the theory of estimation of many parameters, Journal of Soviet Mathematics, 34 (1986), 1373–1403. https://doi.org/10.1007/BF01085007 doi: 10.1007/BF01085007
    [23] S. Boyd, L. Vandenberghe, Convex optimization, Cambridge: Cambridge University Press, 2004.
    [24] B. Zhang, S. Yuan, Shrinkage estimators of large covariance matrices with Toeplitz targets in array signal processing, Sci. Rep., 12 (2022), 19032. https://doi.org/10.1038/s41598-022-21889-8 doi: 10.1038/s41598-022-21889-8
    [25] A. Dembo, C. Mallows, L. Shepp, Embedding nonnegative definite toeplitz matrices in nonnegative definite circulant matrices with application to covariance estimation, IEEE T. Inform. Theory, 35 (1989), 1206–1212. https://doi.org/10.1109/18.45276 doi: 10.1109/18.45276
    [26] F. Zhang, The Schur complement and its applications, New York: Springer, 2005. https://doi.org/10.1007/b105056
  • Reader Comments
  • © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1125) PDF downloads(31) Cited by(0)

Figures and Tables

Figures(3)  /  Tables(3)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog