Research article Special Issues

A hybrid approach to conjugate gradient algorithms for nonlinear systems of equations with applications in signal restoration

  • Received: 16 September 2024 Revised: 05 November 2024 Accepted: 11 November 2024 Published: 27 December 2024
  • MSC : 65K05, 90C56

  • This paper proposes a novel hybrid PRP-HS-LS-type conjugate gradient algorithm for solving constrained nonlinear systems of equations. The proposed algorithm presents several significant advancements and key features: (i) the conjugate parameter is constructed by utilizing the hybrid technique; (ii) the search direction, designed with the conjugate parameter, possesses sufficient descent and trust region properties without the need for a line search mechanism; (iii) the global convergence is rigorously established under general assumptions, notably without the requirement of the Lipschitz continuity condition; (vi) numerical experiments demonstrate the algorithm's efficiency, particularly in solving large-scale constrained nonlinear systems of equations and addressing the sparse signal restoration problem.

    Citation: Xuejie Ma, Songhua Wang. A hybrid approach to conjugate gradient algorithms for nonlinear systems of equations with applications in signal restoration[J]. AIMS Mathematics, 2024, 9(12): 36167-36190. doi: 10.3934/math.20241717

    Related Papers:

    [1] Ping Zhu . Dynamics of the positive almost periodic solution to a class of recruitment delayed model on time scales. AIMS Mathematics, 2023, 8(3): 7292-7309. doi: 10.3934/math.2023367
    [2] Yanshou Dong, Junfang Zhao, Xu Miao, Ming Kang . Piecewise pseudo almost periodic solutions of interval general BAM neural networks with mixed time-varying delays and impulsive perturbations. AIMS Mathematics, 2023, 8(9): 21828-21855. doi: 10.3934/math.20231113
    [3] Xiaofang Meng, Yongkun Li . Pseudo almost periodic solutions for quaternion-valued high-order Hopfield neural networks with time-varying delays and leakage delays on time scales. AIMS Mathematics, 2021, 6(9): 10070-10091. doi: 10.3934/math.2021585
    [4] Shihe Xu, Zuxing Xuan, Fangwei Zhang . Analysis of a free boundary problem for vascularized tumor growth with time delays and almost periodic nutrient supply. AIMS Mathematics, 2024, 9(5): 13291-13312. doi: 10.3934/math.2024648
    [5] Ramazan Yazgan . An analysis for a special class of solution of a Duffing system with variable delays. AIMS Mathematics, 2021, 6(10): 11187-11199. doi: 10.3934/math.2021649
    [6] Yongkun Li, Xiaoli Huang, Xiaohui Wang . Weyl almost periodic solutions for quaternion-valued shunting inhibitory cellular neural networks with time-varying delays. AIMS Mathematics, 2022, 7(4): 4861-4886. doi: 10.3934/math.2022271
    [7] Lini Fang, N'gbo N'gbo, Yonghui Xia . Almost periodic solutions of a discrete Lotka-Volterra model via exponential dichotomy theory. AIMS Mathematics, 2022, 7(3): 3788-3801. doi: 10.3934/math.2022210
    [8] Qi Shao, Yongkun Li . Almost periodic solutions for Clifford-valued stochastic shunting inhibitory cellular neural networks with mixed delays. AIMS Mathematics, 2024, 9(5): 13439-13461. doi: 10.3934/math.2024655
    [9] Ardak Kashkynbayev, Moldir Koptileuova, Alfarabi Issakhanov, Jinde Cao . Almost periodic solutions of fuzzy shunting inhibitory CNNs with delays. AIMS Mathematics, 2022, 7(7): 11813-11828. doi: 10.3934/math.2022659
    [10] Jin Gao, Lihua Dai . Weighted pseudo almost periodic solutions of octonion-valued neural networks with mixed time-varying delays and leakage delays. AIMS Mathematics, 2023, 8(6): 14867-14893. doi: 10.3934/math.2023760
  • This paper proposes a novel hybrid PRP-HS-LS-type conjugate gradient algorithm for solving constrained nonlinear systems of equations. The proposed algorithm presents several significant advancements and key features: (i) the conjugate parameter is constructed by utilizing the hybrid technique; (ii) the search direction, designed with the conjugate parameter, possesses sufficient descent and trust region properties without the need for a line search mechanism; (iii) the global convergence is rigorously established under general assumptions, notably without the requirement of the Lipschitz continuity condition; (vi) numerical experiments demonstrate the algorithm's efficiency, particularly in solving large-scale constrained nonlinear systems of equations and addressing the sparse signal restoration problem.



    Let V be an -dimensional vector space over a field K of characteristic 0. An arrangement of hyperplanes A is a finite collection of codimension one affine subspaces in V. An arrangement A is called central if every hyperplane HA goes through the origin.

    Let V be the dual space of V, and S=S(V) be the symmetric algebra over V. A K-linear map θ:SS is called a derivation if for f,gS,

    θ(fg)=fθ(g)+gθ(f).

    Let DerK(S) be the S-module of derivations. When A is central, for each HA, choose αHV with ker(αH)=H. Define an S-submodule of DerK(S), called the module of A-derivations by

    D(A):={θDerK(S)|θ(αH)αHSforallHA}.

    The arrangement A is called free if D(A) is a free S-module. Then, D(A) has a basis comprising of homogeneous elements. For an affine arrangement A in V, cA denotes the cone over A [7], which is a central arrangement in an (+1)-dimensional vector space by adding the new coordinate z.

    Let E=R be an -dimensional Euclidean space with a coordinate system x1,,x, and let Φ be a crystallographic irreducible root system in the dual space E. Let Φ+ be a positive system of Φ. For αΦ+ and kZ, define an affine hyperplane Hα,k by

    Hα,k:={vE(α,v)=k}.

    The Shi arrangement Shi() was introduced by Shi in the study of the Kazhdan-Lusztig representation theory of the affine Weyl groups in [9] by

    Shi():={Hα,kαΦ+,0k1},

    when the root system is of type A1.

    For mZ0, the extended Shi arrangement Shik of the type Φ is an affine arrangement defined by

    Shik:={Hα,kαΦ+,m+1km}.

    There are a lot of researches on the freeness of the cones over the extended Shi arrangements [1,3,4]. The first breakthrough was the proof of the freeness of multi-Coxeter arrangements with constant multiplicities by Terao in [13]. Combining it with algebro-geometric method, Yoshinaga proved the freeness of the extended Shi arrangements in [15]. Nevertheless, there has been limited progress in constructing their bases, and a universal method for determining these bases remains elusive. For types A1, B, C, and D, explicit bases for the cones over the Shi arrangements were constructed in [6,10,11]. Notably, a basis for the extended Shi arrangements of type A2 was established in [2]. Recently, Suyama and Yoshinaga constructed explicit bases for the extended Shi arrangements of type A1 using discrete integrals in [12]. Feigin et al. presented integral expressions for specific bases of certain multiarrangements in [5]. In these studies, Suyama and Terao first constructed a basis for the derivation module of the cone over the Shi arrangement, as detailed in [11], with Bernoulli polynomials playing a central role in their approach. The following definitions are pertinent to this result.

    For (k1,k2)(Z0)2, the homogenization polynomial of degree k1+k2+1 is defined by

    ¯Bk1,k2(x,z):=zk1+k2+1k1i=01k2+i+1(k1i){Bk2+i+1(xz)Bk2+i+1},

    where Bk(x) denotes the k-th Bernoulli polynomial and Bk(0)=Bk denotes the k-th Bernoulli number. Using this polynomial, the basis for D(cShi()) was constructed as follows.

    Theorem 1.1. [11, Theorem 3.5] The arrangement cShi() is free with the exponents (0,1,1). The homogeneous derivations

    η1:=1+2++,η2:=x11+x22++x+zz,ψ()j:=(xjxj+1z)i=10k1j10k2j1(1)k1+k2Ijk11[1,j1]Ijk21[j+2,]¯Bk1,k2(xi,z)i,

    form a basis for D(cShi()), where 1j1 and i(1i), z denote xi, z respectively. Ik[u,v] represents the elementary symmetric function in the variables {xu,xu+1,,xv} of degree k for 1uv.

    The above conclusion was reached by using Saito's criterion, which is a crucial theorem for determining the basis of a free arrangement.

    Theorem 1.2. [8, Saito's criterion] Let A be a central arrangement, and Q(A) be the defining polynomial of A. Given θ1,,θD(A), the following two conditions are equivalent:

    (1)detM(θ1,,θ)Q(A),

    (2)θ1,,θ form a basis for D(A) over S,

    where M(θ1,,θ)=(θj(xi))× denotes the coefficient matrix, and AB means that A=cB, cK{0}.

    This theorem provides a useful tool for determining when a set of derivations forms a basis for the module of derivations associated with a central arrangement.

    Let α=(1,,1)T and β=(x1,,x)T be the ×1 column vectors, and define ψ()i,j:=ψ()j(xi) for 1i, 1j1. Suyuma and Terao in [11] proved the equality

    detM(η1,η2,ψ()1,,ψ()1)=det(αβ(ψ()i,j)×(1)0z01×(1))(+1)×(+1)z1m<n(xmxn)(xmxnz),

    which yields

    det(α(ψ()i,j)×(1))1m<n(xmxn)(xmxnz). (1.1)

    A graph G=(V,E) is defined as an ordered pair, where the set V={1,2,,} represents the vertex set, and E is a collection of two-element subsets of V. If {i,j}E for some i,jV, then {i,j} is referred to as an edge. Writing {i,j}G implies {i,j}E. Let UV, and define E(U)={{i,j}i,jU,{i,j}E}. We say U induces a subgraph GU=(U,E(U)). Specifically, we use the symbol KU for the induced subgraph of the complete graph K. For i<j, the interval notation [i,j] represents {i,i+1,,j}.

    For a graph G on the vertex set {1,2,,}, the arrangement Shi(G) was defined in [14] by

    Shi(G):={{xmxn=0}|{m,n}G}{{xmxn=1}|1m<n}.

    Then, Shi(G) is an arrangement between the Linial arrangement

    {{xmxn=1}1m<n},

    and the Shi arrangement Shi(). Write A(G):=cShi(G). It was classified to be free according to the following theorem.

    Theorem 1.3. [14, Theorem 3] The arrangement A(G) is free if and only if G consists of all edges of three complete induced subgraphs G[1,s],G[t,],G[2,1], where 1s, ts+1. The free arrangement A(G) has exponents (0,1,(1)+ts2,st+1) for s< and t>1, and (0,1,1) for s= or t=1.

    For s,tZ+, we may define the arrangement

    A[s,t]:=A(K[2,1]){{x1xn=0}2ns}{{xmx=0}1tm1}.

    By Theorem 1.3, for 1s and ts+1, the arrangement A[s,t] is free with exponents (0,1,(1)+ts2,st+1) for s< and t>1, and (0,1,1) for s= or t=1.

    For 0q2, we write A[q]:=A[1,q], then A[q] is free with exponents (0,1,(1)q1,q).

    In this section, based on the conclusions of Suyama and Terao, we provide an explicit construction of the basis for D(A[q]), 0q2. First, we shall establish a basis for D(A[0]), which is the ingredient of the basis for D(A[q]).

    Theorem 2.1. For 1j2, define homogeneous derivations

    φ(0)j:=(xjxj+1z)i=10k1j10k2j2(1)k1+k2Ijk11[1,j1]Ijk22[j+2,1]¯Bk1,k2(yi,z)i,φ(0)1:=1s=1(xsxz)D(A[0]),

    where

    yi={xi,1i1,x+z,i=.

    Then, the derivations η1,η2,φ(0)1,,φ(0)1 form a basis for D(A[0]).

    Proof. Write φ(0)i,j:=φ(0)j(xi),1i,1j1, and from the definitions of φ(0)j and ψ()j, we can get

    φ(0)i,j=ψ(1)i,j, (2.1)

    for 1i1, 1j2. Consequently, for 1m<n1, it follows that φ(0)j(xmxn) is divisible by xmxn, and φ(0)j(xmxnz) is divisible by xmxnz. For 1m1, let the congruence notation (m,k) in the subsequent calculation denote modulo the ideal (xmxkz). We derive

    φ(0)j(xmxz)=(xjxj+1z)0k1j10k2j2(1)k1+k2Ijk11[1,j1]Ijk22[j+2,1][¯Bk1,k2(xm,z)¯Bk1,k2(x+z,z)](m,1)0,

    which implies that φ(0)j(xmxz) is divisible by xmxz. Thus, φ(0)jD(A[0]) for 1j2. Therefore, we have η1,η2,φ(0)1,,φ(0)1D(A[0]). Additionally, we obtain

    detM(η1,η2,φ(0)1,,φ(0)1)=(1)+1zdet(1φ(0)1,1φ(0)1,201φ(0)1,1φ(0)1,201φ(0),1φ(0),21s=1(xsxz))×=(1)+1z1s=1(xsxz)det(1φ(0)1,1φ(0)1,21φ(0)1,1φ(0)1,2)(1)×(1)=(1)+1z1s=1(xsxz)det(α1(φ(0)i,j)(1i1,1j2))(1)×(1).

    According to the equalities (1.1) and (2.1), we have

    det(α1(φ(0)i,j)(1i1,1j2))1m<n1(xmxn)(xmxnz).

    Hence, we obtain

    detM(η1,η2,φ(0)1,,φ(0)1).=z1s=1(xsxz)1m<n1(xmxn)(xmxnz)=z1m<n1(xmxn)1m<n(xmxnz)=Q(A[0]).

    By applying Theorem 1.2, we conclude that the derivations η1,η2,φ(0)1,,φ(0)1 form a basis for D(A[0]).

    Definition 2.1. For 1q2, 1j1, define the homogeneous derivations

    φ(q)j:={φ(0)j,1jq2,(xj+1x)φ(0)j(xjxj+1z)j1a=q1φ(0)a,q1j3,φ(0)j+1+ja=q1(a1)φ(0)a,j=2,(xjx)φ(0)j+(xjxj+1z)j2a=q1(a2)φ(0)a,j=1.

    To prove the derivations η1,η2,φ(q)1,,φ(q)1 form a basis for D(A[q]), first we prove all such derivations belong to the module D(A[q]).

    Theorem 2.2. For 1m1, 1j2, we have

    φ(0)j(xmx)(m,0)(z)(xjxj+1z)j1s=1(xsxmz)1s=j+2(xsxm). (2.2)

    Proof. We have the following congruence relation of polynomials modulo the ideal (xmx).

    φ(0)j(xmx)=(xjxj+1z)0k1j10k2j2(1)k1+k2Ijk11[1,j1]Ijk22[j+2,1][¯Bk1,k2(xm,z)¯Bk1,k2(x+z,z)](m,0)(xjxj+1z)0k1j10k2j2(1)k1+k2+1Ijk11[1,j1]Ijk22[j+2,1][¯Bk1,k2(xm+z,z)¯Bk1,k2(xm,z)]=(xjxj+1z)0k1j10k2j2(1)k1+k2+1Ijk11[1,j1]Ijk22[j+2,1]zk1+k2+1(xm+zz)k1(xmz)k2=(z)(xjxj+1z)j1k1=0Ijk11[1,j1][(xm+z)]k1j2k2=0Ijk22[j+2,1](xm)k2=(z)(xjxj+1z)j1s=1(xsxmz)1s=j+2(xsxm).

    We complete the proof.

    Remark 2.1 In equality (2.2), we observe that 1s=j+2(xsxm)=0 for j+2m1. This implies that φ(0)j(xmx) is divisible by xmx for 1j3 and j+2m1.

    According to Remark 2.1, for 1jq2, we have φ(0)j(xmx) is divisible by xmx for qm1, which implies that φ(q)j=φ(0)jD(A[q]). Therefore, to prove the derivations belong to the module D(A[q]), it suffices to prove φ(q)jD(A[q]) for q1j1.

    For the sake of convenience in the proof, let us introduce the notations for f,g,hZ+,

    A[g,h]f:=hs=g(xsxf),B[g,h]f:=hs=g(xsxfz).

    If g>h, we agree that A[g,h]f=B[g,h]f=1.

    Lemma 2.1. For any u,v,wZ+ that satisfy 4j+1u2, 3v2, and 3w2, we have the following three equalities:

    B[u,j1]u1=A[u+1,j]u1+j1a=u(xaxa+1z)A[a+2,j]u1B[u,a1]u1. (2.3)
    B[v,1]v1=(v+1)A[v,1]v1+2a=v1(a1)(xaxa+1z)A[a+2,1]v1B[v1,a1]v1. (2.4)
    B[w,2]w1=wA[w,2]w1+3a=w1(a2)(xaxa+1z)A[a+2,2]w1B[w1,a1]w1. (2.5)

    Proof. We will only prove equality (2.5) by induction on w. The proofs of equalities (2.3) and (2.4) are similar. For w=3,

    3A[3,2]4+3a=4(a2)(xaxa+1z)A[a+2,2]4B[4,a1]4=3(x3x4)(x2x4)+2(x4x3z)(x2x4)+(x3x2z)(z)=(x3x4z)(x2x4z)=B[3,2]4,

    and the equality holds. Assume that for w=k3, the equality holds. Then, we replace xk1 with xk2, and multiply both sides of the equality by (xk1xk2z) to get

    B[k1,2]k2=(k1)(xk2xkz)(xk1xk2z)A[k+1,2]k2+k(xk1xk2z)A[k,2]k2+3a=k(a2)(xaxa+1z)A[a+2,2]k2B[k2,a1]k2=(k+1)A[k1,2]k2+3a=k2(a2)(xaxa+1z)A[a+2,2]k2B[k2,a1]k2.

    We have completed the induction.

    Lemma 2.2. The derivation φ(q)j belongs to the module D(A[q]) for 2q2 and q1j3.

    Proof. For 2q2 and j=q1, it is evident from Remark 2.1 that

    φ(q)q1=(xqx)φ(0)q1D(A[q]).

    For 3q2 and qj3, we will establish this by induction on q. From Theorem 2.2, for qm1, we have

    φ(q)j(xmx)=(xj+1x)φ(0)j(xmx)(xjxj+1z)j1a=q1φ(0)a(xmx)(m,0)(z)(xjxj+1z)A[j+1,1]mB[1,q2]m[B[q1,j1]mj1a=q1(xaxa+1z)A[a+2,j]mB[q1,a1]m].

    (1) For q=3, we get

    φ(3)3(xmx)(m,0)(z)(x3x2z)A[2,1]mB[1,5]m(x3xm).

    If m=3,2,1, then we have φ(3)3(xmx)(m,0)0, which indicates that φ(3)3(xmx) is divisible by xmx for m=3,2,1. Therefore, φ(3)jD(A[3]).

    (2) For q=k3, assume that φ(k)jD(A[k]), which implies that φ(k)j(xmx) is divisible by xmx for km1.

    For q=k+1, we observe that

    φ(k+1)j=φ(k)j(xjxj+1z)φ(0)k2.

    According to the induction hypothesis and Remark 2.1, it is sufficient to prove that φ(k+1)j(xk1x) is divisible by xk1x. By using the equality (2.3), we obtain

    φ(k+1)j(xk1x)(k1,0)(z)(xjxj+1z)A[j+1,1]k1B[1,k3]k1[B[k2,j1]k1j1a=k2(xaxa+1z)A[a+2,j]k1B[k2,a1]k1]=(z)2(xjxj+1z)A[j+1,1]k1B[1,k2]k1[B[k,j1]k1A[k+1,j]k1j1a=k(xaxa+1z)A[a+2,j]k1B[k,a1]k1]=0.

    Therefore, φ(k+1)j(xk1x) is divisible by xk1x, and it follows that φ(k+1)jD(A[k+1]). Consequently, we can conclude that for any 3q2 and qj3, φ(q)jD(A[q]).

    Lemma 2.3. The derivation φ(q)2 belongs to the module D(A[q]) for 1q2.

    Proof. From Theorem 2.2, we can get the following equality for qm1,

    φ(q)2(xmx)=φ(0)1(xmx)+2a=q1(a1)φ(0)a(xmx)(m,0)B[1,1]m+(z)2a=q1(a1)(xaxa+1z)A[a+2,1]mB[1,a1]m.

    (1) For q=1,2, this conclusion is straightforward to verify.

    (2) For q=k3, assume that φ(k)2D(A[k]), which implies that φ(k)2(xmx) is divisible by xmx for km1.

    For q=k+1, we have

    φ(k+1)2=φ(k)2+(k+1)φ(0)k2.

    By using the equality (2.4), we have

    φ(k+1)2(xk1x)(k1,0)B[1,1]k1+(z)2a=k2(a1)(xaxa+1z)A[a+2,1]k1B[1,a1]k1=B[1,k1]k1[B[k,1]k1+(k+1)A[k,1]k1+2a=k1(a1)(xaxa+1z)A[a+2,1]k1B[k1,a1]k1]=0.

    Therefore, φ(k+1)2(xk1x) is divisible by xk1x. According to the induction hypothesis and Remark 2.1, we have φ(k+1)2D(A[k+1]). Hence, we may conclude that for any 1q2, φ(q)2D(A[q]).

    Lemma 2.4. The derivation φ(q)1 belongs to the module D(A[q]) for 1q2.

    Proof. First, from Theorem 2.2, for qm1, we can get

    φ(q)1(xmx)=(x1x)φ(0)1(xmx)+(x1xz)3a=q1(a2)φ(0)a(xmx)(m,0)(x1xm)B[1,1]m+(z)(x1xmz)3a=q1(a2)(xaxa+1z)A[a+2,1]mB[1,a1]m.

    (1) For q=1,2, it is obvious that φ(q)1D(A[q]).

    (2) For q=k3, assume that φ(k)1D(A[k]), which implies that φ(k)1(xmx) is divisible by xmx for km1.

    For q=k+1, we can see

    φ(k+1)1=φ(k)1+k(x1xz)φ(0)k2.

    By using the equality (2.5), we have

    φ(k+1)1(xk1x)(k1,0)(x1xk1)B[1,1]k1+(z)(x1xk1z)3a=k2(a2)(xaxa+1z)A[a+2,1]k1B[1,a1]k1=(x1xk1)(x1xk1z)B[1,k1]k1[B[k,2]k1+kA[k,2]k1+3a=k1(a2)(xaxa+1z)A[a+2,2]k1B[k1,a1]k1]=0.

    Therefore, φ(k+1)1(xk1x) is divisible by xk1x. According to the induction hypothesis and Remark 2.1, we have φ(k+1)1D(A[k+1]). Hence, we may conclude that for any 1q2, φ(q)1D(A[q]).

    From the above proof, we finally conclude that φ(q)1,,φ(q)1 belong to the module D(A[q]).

    Theorem 2.3. For 1q2, the derivations η1,η2,φ(q)1,,φ(q)1 form a basis for D(A[q]).

    Proof. According to Lemmas 2.2–2.4, it suffices to prove that

    detM(η1,η2,φ(q)1,,φ(q)1)Q(A[q]).

    Let

    γ1=(q,q1,,1,1)T

    and

    γ2=((q1)(x1xz),(q2)(x1xz),,x1xz,0,x1x)T

    be the (q+1)×1 column vectors, and define a matrix

    M(q+1)×(q1):=(xqx(xqxq+1z)(x3x2z)0xq+1x(x3x2z)00x2x000000).

    Write ˜M(q+1)×(q+1):=(M(q+1)×(q1),γ1,γ2), then

    det˜M(q+1)×(q+1)=1s=q(xsx).

    Thus, we obtain the following equality

    (η1,η2,φ(q)1,,φ(q)1)(+1)×(+1)=(η1,η2,φ(0)1,,φ(0)1)(Eq0(q)×(q+1)0(q+1)×(q)˜M(q+1)×(q+1)).

    Hence,

    detM(η1,η2,φ(q)1,,φ(q)1)=detM(η1,η2,φ(0)1,,φ(0)1)det˜M(q+1)×(q+1).=z1m<n1(xmxn)1m<n(xmxnz)1s=q(xsx)=Q(A[q]).

    We complete the proof.

    Meihui Jiang: writing-original draft; Ruimei Gao: writing-review and editing, methodology and supervision. All authors have read and approved the final version of the manuscript for publication.

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

    The work was partially supported by Science and Technology Development Plan Project of Jilin Province, China (No. 20230101186JC) and NSF of China (No. 11501051).

    The authors declare no conflict of interest in this paper.



    [1] W. Xue, P. Wan, Q. Li, An online conjugate gradient algorithm for large-scale data analysis in machine learning, AIMS Mathematics, 6 (2021), 1515–1537. https://doi.org/10.3934/math.2021092 doi: 10.3934/math.2021092
    [2] J. Chorowsk, J. M. Zurada, Learning understandable neural networks with nonnegative weight constraints, IEEE Trans. Neural. Netw. Learn. Syst., 26 (2015), 62–69. https://doi.org/10.1109/TNNLS.2014.2310059 doi: 10.1109/TNNLS.2014.2310059
    [3] Y. H. Zheng, B. Jeon, D. H. Xu, Q. M. Wu, H. Zhang, Image segmentation by generalized hierarchical fuzzy C-means algorithm, J. Intell. Fuzzy Syst., 28 (2015), 961–973. https://doi.org/10.3233/IFS-141378 doi: 10.3233/IFS-141378
    [4] Y. Li, C. Li, W. Yang, A new conjugate gradient method with a restart direction and its application in image restoration, AIMS Mathematics, 12 (2023), 28791–28807. https://doi.org/10.3934/math.20231475 doi: 10.3934/math.20231475
    [5] S. Aji, P. Kumam, A. M. Awwal, An efficient DY-type spectral conjugate gradient method for system of nonlinear monotone equations with application in signal recovery, Aims Mathematics, 6 (2021), 8078–8106. https://doi.org/10.3934/math.2021469 doi: 10.3934/math.2021469
    [6] K. Ahmed, M. Y. Waziri, A. S. Halilu, Sparse signal reconstruction via Hager-Zhang-type schemes for constrained system of nonlinear equations, Optimization, 73 (2024), 1949–1980. https://doi.org/10.1080/02331934.2023.2187255 doi: 10.1080/02331934.2023.2187255
    [7] D. D. Li, S. H. Wang, Y. Li, J. Q. Wu, A projection-based hybrid PRP-DY type conjugate gradient algorithm for constrained nonlinear equations with applications, Appl. Numer. Math., 195 (2024), 105–125. https://doi.org/10.1016/j.apnum.2023.09.009 doi: 10.1016/j.apnum.2023.09.009
    [8] M. Dehghan, A. Shirilord, Three-step iterative methods for numerical solution of systems of nonlinear equations, Eng. Comput., 38 (2022), 1015–1028. https://doi.org/10.1007/s00366-020-01072-1 doi: 10.1007/s00366-020-01072-1
    [9] M. Dehghan, G. Karamali, A. Shirilord, An iterative scheme for a class of generalized Sylvester matrix equations, AUT J. Math. Comut., 5 (2024), 195–215.
    [10] K. Meinijes, A. P. Morgan, A methodology for solving chemical equilibrium systems, Appl. Math. Comput., 22 (1987), 333–361.
    [11] X. Tong, S. Zhou, A smoothing projected Newton-type method for semismooth equations with bound constraints, J. Ind. Manag. Optim., 1 (2005), 235–250. https://doi.org/10.3934/jimo.2005.1.235 doi: 10.3934/jimo.2005.1.235
    [12] M. Dehghan, M. Hajarian, Fourth-order variants of Newton's method without second derivatives for solving non-linear equations, Eng. Comput., 29 (2012), 356–365. https://doi.org/10.1108/02644401211227590 doi: 10.1108/02644401211227590
    [13] C. Wang, Y. Wang, C. Xu, A projection method for a system of nonlinear monotone equations with convex constraints, Math. Meth. Oper. Res., 66 (2007), 33–46. https://doi.org/10.1007/s00186-006-0140-y doi: 10.1007/s00186-006-0140-y
    [14] G. Yuan, Z. Wei, M. Zhang, An active-set projected trust region algorithm for box constrained optimization problems, J. Syst. Sci. Complex., 28 (2015), 1128–1147. https://doi.org/10.1007/s11424-014-2199-5 doi: 10.1007/s11424-014-2199-5
    [15] J. Fan, On the levenberg-marquardt methods for convex constrained nonlinear equations, J. Ind. Manag. Optim., 9 (2013), 227–241. https://doi.org/10.3934/jimo.2013.9.227 doi: 10.3934/jimo.2013.9.227
    [16] J. Yin, J. Jian, G. Ma, A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations, Comput. Optim. Appl., 87 (2024), 289–322. https://doi.org/10.1007/s10589-023-00513-z doi: 10.1007/s10589-023-00513-z
    [17] Y. Ding, Y. Xiao, J. Li, A class of conjugate gradient methods for convex constrained monotone equations, Optimization, 66 (2017), 2309–2328. https://doi.org/10.1080/02331934.2017.1372438 doi: 10.1080/02331934.2017.1372438
    [18] M. Sun, J. Liu, New hybrid conjugate gradient projection method for the convex constrained equations, Calcolo, 53 (2016), 399–411. https://doi.org/10.1007/s10092-015-0154-z doi: 10.1007/s10092-015-0154-z
    [19] H. Zheng, J. Li, P. Liu, An inertial Fletcher-Reeves-type conjugate gradient projection-based method and its spectral extension for constrained nonlinear equations, J. Appl. Math. Comput., 70 (2024), 2427–2452. https://doi.org/10.1007/s12190-024-02062-y doi: 10.1007/s12190-024-02062-y
    [20] Z. Yu, J. Lin, J. Sun, Y. Xiao, L. Liu, Z. Li, Spectral gradient projection method for monotone nonlinear equations with convex constraints, Appl. Numer. Math., 59 (2009), 2416–2423. https://doi.org/10.1016/j.apnum.2009.04.004 doi: 10.1016/j.apnum.2009.04.004
    [21] M. Dehghan, R. Mohammadi-Arani, Generalized product-type methods based on bi-conjugate gradient (GPBiCG) for solving shifted linear systems, Comput. Appl. Math., 36 (2017), 1591–1606. https://doi.org/10.1007/s40314-016-0315-y doi: 10.1007/s40314-016-0315-y
    [22] J. K. Liu, Y. M. Feng, A derivative-free iterative method for nonlinear monotone equations with convex constraints, Numer. Algor., 82 (2019), 245–262. https://doi.org/10.1007/s11075-018-0603-2 doi: 10.1007/s11075-018-0603-2
    [23] W. J. Hu, J. Z. Wu, G. L. Yuan, Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration, Appl. Numer. Math., 158 (2020), 360–376. https://doi.org/10.1016/j.apnum.2020.08.009 doi: 10.1016/j.apnum.2020.08.009
    [24] G. Ma, J. Jin, J. Jian, D. Han, A modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensing, Numer. Algor., 92 (2023), 1621–1653. https://doi.org/10.1007/s11075-022-01356-1 doi: 10.1007/s11075-022-01356-1
    [25] J. H. Yin, J. B. Jian, X. Z. Jiang, M. X. Liu, L. Wang, A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications Numer. Algor., 88 (2021), 389–418.
    [26] P. T. Gao, C. J. He, Y. Liu, An adaptive family of projection methods for constrained monotone nonlinear equations with applications, Appl. Math. Comput., 359 (2019), 1–16. https://doi.org/10.1016/j.amc.2019.03.064 doi: 10.1016/j.amc.2019.03.064
    [27] M. Li, A modified Hestense-Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method, Optim. Methods Softw., 33 (2018), 336–353. https://doi.org/10.1080/10556788.2017.1325885 doi: 10.1080/10556788.2017.1325885
    [28] M. Li, A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method, J. Ind. Manag. Optim., 16 (2018), 245–260.
    [29] A. B. Abubakar, P. Kumam, H. Mohammad, A note on the spectral gradient projection method for nonlinear monotone equations with applications, Comput. Appl. Math., 39 (2020), 129. https://doi.org/10.1007/s40314-020-01151-5 doi: 10.1007/s40314-020-01151-5
    [30] J. K. Liu, S. J. Li, A projection method for convex constrained monotone nonlinear equations with applications, Comput. Math. Appl., 70 (2015), 2442–2453. https://doi.org/10.1016/j.camwa.2015.09.014 doi: 10.1016/j.camwa.2015.09.014
    [31] E. D. Dolan, J. Jorge, Benchmarking optimization software with performance profiles, Math. Program., 91 (2001), 201–213. https://doi.org/10.1007/s101070100263 doi: 10.1007/s101070100263
    [32] D. D. Li, J. Q. Wu, Y. Li, S. H. Wang, A modified spectral gradient projection-based algorithm for large-scale constrained nonlinear equations with applications in compressive sensing, J. Comput. Appl. Math., 424 (2023), 115006. https://doi.org/10.1016/j.cam.2022.115006 doi: 10.1016/j.cam.2022.115006
    [33] M. A. T. Figueiredo, R. D. Nowak, S. J. Wright, Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems, IEEE J. Sel. Top. Signal Process., 1 (2007), 586–597. https://doi.org/10.1109/JSTSP.2007.910281 doi: 10.1109/JSTSP.2007.910281
    [34] Y. Xiao, Q. Wang, Q. Hu, Non-smooth equations based method for 1-norm problems with applications to compressed sensing, Nonlinear Anal. Theory Methods Appl., 74 (2011), 3570–3577.
  • 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(712) PDF downloads(49) Cited by(0)

Figures and Tables

Figures(7)  /  Tables(7)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog