# A Descent Dai-Liao Conjugate Gradient Method Based on a Modified Secant Equation and Its Global Convergence

Authors: Ioannis E. Livieris; Panagiotis Pintelas
Journal: ISRN Computational Mathematics
 (2012)

---

## Abstract

We propose a conjugate gradient method which is based on the
study of the Dai-Liao conjugate gradient method. An important property of our proposed
method is that it ensures sufficient descent independent of the accuracy of the line search.
Moreover, it achieves a high-order accuracy in approximating the second-order curvature
information of the objective function by utilizing the modified secant condition proposed
by Babaie-Kafaki et al. (2010). Under mild
conditions, we establish that the proposed method is globally convergent for general functions
provided that the line search satisfies the Wolfe conditions. Numerical experiments
are also presented.


---

## Body

## 1. Introduction

We consider the unconstrained optimization problem:(1)min⁡f(x),x∈Rn,
where f:ℝn→ℝ is a continuously differentiable function. Conjugate gradient methods are probably the most famous iterative methods for solving the optimization problem (1), especially when the dimension is large characterized by the simplicity of their iteration and their low memory requirements. These methods generate a sequence of points {xk}, starting from an initial point x0∈ℝn, using the iterative formula:(2)xk+1=xk+αkdk,k=0,1,…,
where αk>0 is the stepsize obtained by some line search and dk is the search direction defined by(3)dk={-g0,ifk=0;-gk+βkdk-1,otherwise,
where gk is the gradient of f at xk and βk is a scalar. Well-known formulas for βk include the Hestenes-Stiefel (HS) [1], the Fletcher-Reeves (FR) [2], the Polak-Ribière (PR) [3], the Liu-Storey (LS) [4], the Dai-Yuan (DY) [5] and the conjugate descent (CD) [6]. They are specified by(4)βkHS=gkTyk-1yk-1Tdk-1,βkFR=∥gk∥2∥gk-1∥2,βkPR=gkTyk-1∥gk-1∥2,βkLS=-gkTyk-1dk-1Tgk-1,βkDY=∥gk∥2yk-1Tdk-1,βkCD=-∥gk∥2dk-1Tgk-1,
respectively, where sk-1=xk-xk-1, yk-1=gk-gk-1, and ∥·∥ denotes the Euclidean norm. If f is a strictly convex quadratic function, and the performed line search is exact, all these methods are equivalent, but for a general function different choices of βk give rise to distinct conjugate gradient methods with quite different computational efficiency and convergence properties. We refer to the books [7, 8], the survey paper [9], and the references therein about the numerical performance and the convergence properties of conjugate gradient methods. During the last decade, much effort has been devoted to develop new conjugate gradient methods which are not only globally convergent for general functions but also computationally superior to classical methods and there are classified by two classes.The first class utilizes the second-order information of the objective function to improve the efficiency and robustness of conjugate gradient methods. Dai and Liao [10] proposed a new conjugate gradient method by exploiting a new conjugacy condition based on the standard secant equation in which βk in (3) is defined by(5)βkDL=gkT(yk-1-tsk-1)dk-1Tyk-1,
where t≥0 is a scalar. Moreover, Dai and Liao also suggested a modification of (5) from a viewpoint of global convergence for general functions, by restricting the first term of being nonnegative, namely,(6)βkDL+=max⁡{gkTyk-1dk-1Tyk-1,0}-tgkTsk-1dk-1Tyk-1.
Along this line, many researchers [11–15] proposed variants of Dai-Liao method based on modified secant conditions with higher orders of accuracy in the approximation of the curvature. Under proper conditions, these methods are globally convergent and sometimes competitive to classical conjugate gradient methods. However, these methods do not ensure to generate descent directions, therefore, the descent condition is usually assumed in their analysis and implementations.The second class focuses to generate conjugate gradient methods which ensure sufficient descent independent of the accuracy of the line search. On the basis of this idea, Hager and Zhang [16] considered to modify parameter βk in (3) and proposed a new conjugate gradient method, called CG-DESCENT in which the update parameter is defined as follows:(7)βkHZ=max⁡{βkN,ηk},
where(8)βkN=gkTyk-1dk-1Tyk-1-2‖yk-1‖2gkTdk-1(dk-1Tyk-1)2,ηk=-1‖dk‖2min⁡{‖gk‖,η},
and η>0 is a constant. An important feature of the CG-DESCENT method is that the generated direction satisfies dkTgk≤-(7/8)∥gk∥2. Moreover, Hager and Zhang [16] established that the CG-DESCENT is globally convergent for general functions under the Wolfe line search conditions.Quite recently, Zhang et al. [17] considered a different approach, to modify the search direction such that the generated direction satisfies gkTdk=-∥gk∥2, independently of the line search used. More analytically, they proposed a modified FR method in which the search direction is given by(9)dk=-(1+βkFRgkTdk-1‖gk‖)gk+βkFRdk-1.
This method is reduced to the standard FR method in case the performed line search is exact. Furthermore, in case βk is specified by another existing conjugate gradient formula, the property gkTdk=-∥gk∥2 is still satisfied. Along this line, many related conjugate gradient methods have been extensively studied [17–24] with strong convergence properties and good average performance.In this work, we propose a new conjugate gradient method which has both characteristics of the two previously discussed classes. More analytically, our method ensures sufficient descent independent of the accuracy of the line search and achieves a high-order accuracy in approximating the second-order curvature information of the objective function by utilizing the modified secant condition proposed by Babaie-Kafaki et al. [11]. Under mild conditions, we establish the global convergence of our proposed method. The numerical experiments indicate that the proposed method is promising.The remainder of this paper is organized as follows. In Section2, we present our motivation and our proposed conjugate gradient method. In Section 3, we present the global convergence analysis of our method. The numerical experiments are reported in Section 4 using the performance profiles of Dolan and Moré [25]. Finally, Section 4 presents our concluding remarks and our proposals for future research.Throughout this paper, we denotef(xk) and ∇2f(xk) as fk and Gk, respectively.


## 2. Algorithm

Firstly, we recall that for quasi-Newton methods, an approximation matrixBk-1 to the Hessian ∇2fk-1 is updated so that a new matrix Bk satisfies the following secant condition:(10)Bksk-1=yk-1.
Zhang et al. [26] and Zhang and Xu [27] expanded this condition and derived a class of modified secant condition with a vector parameter, in the form(11)Bksk-1=ỹk-1,ỹk-1=yk-1+θk-1sk-1Tuu,
where u is any vector satisfying sk-1Tu>0, and θk-1 is defined by(12)θk-1=6(fk-1-fk)+3(gk+gk-1)Tsk-1.
Observing that this new quasi-Newton equation contains not only gradient value information but also function value information at the present and the previous step. Moreover, in [26], Zhang et al. proved that if ∥sk-1∥ is sufficiently small, then(13)sk-1T(Gksk-1-yk-1)=O(‖sk-1‖3),sk-1T(Gksk-1-ỹk-1)=O(‖sk-1‖4).
Clearly, these equations imply that the quantity sk-1Tỹk-1 approximates the second order curvature sk-1TGksk-1 with a higher precision than the quantity sk-1Tyk-1 does.However, for values of∥sk-1∥ greater than one (i.e., ∥sk-1∥>1), the standard secant equation (10) is expected to be more accurate than the modified secant equation (11). Recently, Babaie-Kafaki et al. [11] to overcome this difficulty considered an extension of the modified secant (11) as follows:(14)Bksk-1=ỹk-1*,ỹk-1*=yk-1+ρk-1max⁡{θk-1,0}sk-1Tuu,
where parameter ρk-1 is restricted to values of {0,1} and adaptively switch between the standard secant equation (10) and the modified secant equation (14), by setting ρk-1=1 if ∥sk-1∥≤1 and setting ρk-1=0, otherwise. In the same way as Dai and Liao [10], they obtained an expression for βk, in the form(15)β̃k=gkT(ỹk-1*-tsk-1)dk-1Tỹk-1*,
where t≥0 and ỹk-1* is defined by (14). Furthermore, following Dai and Liao’s approach, in order to ensure global convergence for general functions, they modified formula (15) as follows:(16)β̃k*=max⁡{gkTỹk-1*dk-1Tỹk-1*,0}-tgkTsk-1dk-1Tỹk-1*.Motivated by the theoretical advantages of the modified secant equation (14) and the technique of the modified FR method [17], we propose a new conjugate gradient method as follows. Let the search direction be defined by(17)dk=-(1+βkgkTdk-1‖gk‖)gk+βkdk-1,
where βk is defined by (15). It is easy to see that the sufficient descent condition holds:(18)gkTdk=-‖gk‖2,
using any line search. Moreover, if f is a convex quadratic function and the performed line search is exact, then θk-1=0,ỹk-1*=yk-1, and gkTsk-1=0; hence, the conjugate gradient method (2)–(17) is reduced to the standard conjugate gradient method, accordingly.Now, based on the above discussion, we present our proposed algorithm called modified Dai Liao conjugate gradient algorithm (MDL-CG).


## 3. Convergence Analysis

In order to establish the global convergence analysis, we make the following assumptions for the objective functionf.Assumption 1.
The level setℒ={x∈ℝn∣f(x)≤f(x0)} is bounded, namely, there exists a positive constant B>0 such that
(19)‖x‖≤B,∀x∈L.Assumption 2.
In some neighborhood𝒩∈ℒ, f is differentiable and its gradient g is Lipschitz continuous, namely, there exists a positive constant L>0 such that
(20)‖g(x)-g(y)‖≤L‖x-y‖,∀x,y∈N.
It follows directly from Assumptions1 and 2 that there exists a positive constant M>0 such that
(21)‖g(x)‖≤M,∀x∈L.
In order to guarantee the global convergence of Algorithm1, we will impose that the steplength αk satisfies the Armijo conditions or the Wolfe conditions. The Armijo line search is to find a steplength αk=max{λj,j=0,1,2,…} such that
(22)f(xk+αkdk)-f(xk)≤δαkgkTdk,
where δ,λ∈(0,1) are constants. In the Wolfe line search the steplength αk satisfies
(23)f(xk+αkdk)-f(xk)≤σ1αkgkTdk,(24)g(xk+αkdk)Tdk≥σ2gkTdk,
with 0<σ1<σ2<1.Algorithm 1: (MDL-CG).
1. Choose an initial pointx0∈ℝn; Set k=0.2. If∥gk∥=0, then terminate; Otherwise go to the next.3. Compute the descent directiondk by (15) and (17).4. Determine a stepsizeαk by some line search rule.5. Letxk+1=xk+αkdk.6. Setk=k+1 and go to 2.Next, we present some lemmas which are very important for the global convergence analysis.Lemma 1 (see [11]).
Suppose that Assumptions1 and 2 hold. For θk-1 and ỹk-1* defined by (12) and (14), respectively, one has
(25)|θk-1|≤3L‖sk-1‖2,‖ỹk-1*‖≤4L‖sk-1‖.Lemma 2.
Suppose that Assumptions1 and 2 hold. Let {xk} be generated by Algorithm MDL-CG, where the line search satisfies the Armijo condition (22), then there exists a positive constant c>0 such that
(26)αk≥c‖gk‖2‖dk‖2,
for all k≥0.Proof.
From the Armijo condition (22) and Assumptions 1 and 2, we have
(27)∑k≥0-δαkdkTgk<+∞.
Using this together with inequality (18) implies that
(28)∑k≥0αk‖gk‖2=-∑k≥0αkdkTgk<+∞.
We now prove (26) by considering the following cases.
Case 1.
Ifαk=1, it follows from (18) that ∥dk∥≤∥gk∥. In this case, inequality (26) is satisfied with c=1.
Case 2.
Ifαk<1 by the line search, λ-1αk does not satisfy (22). This implies
(29)f(xk+λ-1αkdk)-f(xk)>δλ-1αkgkTdk.
By the mean-value theorem and Assumptions 1 and 2, we get
(30)f(xk+λ-1αkdk)-f(xk)≤λ-1αkgkTdk+Lλ-2αk2‖dk‖2.
Using this inequality with (18) and (29), we have
(31)αk≥-(1-δ)λLgkTdk‖dk‖2=(1-δ)λL‖gk‖2‖dk‖2.
Letting c=min{1,(1-δ)λ/L}, we get (26), which completes the proof.From inequalities (26) and (28), we can easily obtain the following lemma.Lemma 3.
Suppose that Assumptions1 and 2 hold. Let {xk} be generated by Algorithm MDL-CG where the line search satisfies the Armijo line search (22), then
(32)∑k≥0‖gk‖4‖dk‖2<+∞.Next, we establish the global convergence theorem for Algorithm MDL-CG for uniformly convex functions.Theorem 1.
Suppose that Assumptions1 and 2 hold and f is uniformly convex on ℒ, namely, there exists a positive constant γ>0 such that
(33)γ‖x-y‖2≤(∇f(x)-∇f(y))T(x-y),∀x,y∈L.
Let {xk} and {dk} be generated by Algorithm MDL-CG and let αk satisfy the Armijo condition (22), then one has either gk=0 for some k or
(34)lim⁡k→∞‖gk‖=0.Proof.
Suppose thatgk≠0 for all k≥0. By the convexity assumption (33), we have
(35)dk-1Tỹk-1*≥dk-1Tyk-1≥γαk-1-1‖sk-1‖2.
Combining the previous relation with Lemma 1, we obtain
(36)|β̃k|=|gkT(ỹk-1*-tsk-1)dk-1Tỹk-1*|≤‖gk‖(‖ỹk-1*‖+t‖sk-1‖)|dk-1Tỹk-1*|≤4L+tγ‖gk‖‖dk-1‖.
Therefore, by the definition of the search direction dk in (17) together with the previous inequality, we give an upper bound for ∥dk∥:
(37)‖dk‖≤‖gk‖+|β̃k|‖dk-1‖‖gk‖‖gk‖2‖gk‖+|β̃k|‖dk-1‖≤‖gk‖+2|β̃k|‖dk-1‖≤(1+24L+tγ)‖gk‖.
Inserting this upper bound for dk in (32) yields ∑k≥0∥gk∥2<∞, which completes the proof.For simplicity, in Algorithm1 in case the update parameter βk is computed by (16), we refer it as Algorithm MDL+-CG. In the following, we show that Algorithm MDL+-CG is globally convergent for general nonlinear functions under the Wolfe line search conditions (23) and (24). In the rest of this section, we assume that convergence does not occur, which implies that there exists a positive constant μ>0 such that(38)‖gk‖≥μ,∀k≥0.Lemma 4.
Suppose that Assumptions1 and 2 hold. Let {xk} and {dk} be generated by Algorithm MDL+-CG and let αk be obtained by the Wolfe line search (23) and (24), then there exist positive constants C1 and C2 such that for all k≥1,
(39)|β̃k*|≤C1‖sk-1‖,(40)|β̃k*||gkTdk-1|‖gk‖2≤C2‖sk-1‖.Proof.
From (14), (18) and (24), we have
(41)dk-1Tỹk-1*≥dk-1Tyk-1≥(σ2-1)gk-1Tdk-1=(1-σ2)‖gk-1‖2.
Utilizing this with Lemma 1, Assumption 2, and relations (21) and (38), we have
(42)|β̃k*|≤|gkTỹk-1*dk-1Tỹk-1*|+t|gkTsk-1dk-1Tỹk-1*|≤4ML∥sk-1∥(1-σ2)μ2+tM‖sk-1‖(1-σ2)μ2=(4L+t)M(1-σ2)μ2‖sk-1‖.
Letting C1=(4L+t)M/(1-σ2)μ2, then (39) is satisfied. Furthermore, by the Wolfe condition (24), we have
(43)gkTdk-1≥σ2gk-1Tdk-1≥-σ2dk-1Tỹk-1*+σ2gkTdk-1.
Also, observe that
(44)gkTdk-1=dk-1Tyk-1+gk-1Tdk-1≤dk-1Tỹk-1*.
By rearranging inequality (43), we obtain gkTdk-1≥-(σ2/1-σ2)dk-1Tỹk-1*, and together with (44), we obtain
(45)|gkTdk-1dk-1Tỹk-1*|≤max⁡{σ2(1-σ2),1}.
It follows from Assumption 1 and (18), (24), (38), and (39) that
(46)|β̃k*||gkTdk-1|‖gk‖2≤‖gk‖(‖ỹk-1*‖+t‖sk-1‖)|dk-1Tỹk-1*||gkTdk-1|‖gk‖2≤(4L+t)μmax⁡{σ2(1-σ2),1}‖sk-1‖.
Letting C2=(4L+t)max{σ2/(1-σ2),1}/μ, we obtain (40).Next, we present a lemma which shows that, asymptotically, the search directions change slowly.Lemma 5.
Suppose that Assumptions1 and 2 hold. Let {xk} and {dk} be generated by Algorithm MDL+-CG and let αk be obtained by the Wolfe line search (23) and (24), then dk≠0 and
(47)∑k≥1‖wk-wk-1‖2<∞,
where wk=dk/∥dk∥.Proof.
Firstly, note thatdk≠0, for otherwise (18) would imply gk=0. Therefore, wk is well defined. Next, we divide formula β̃k* in two parts as follows:
(48)β̃k*=β̃k(1)+β̃k(2),
where
(49)β̃k(1)=max⁡{gkTỹk-1*dk-1Tỹk-1*,0},β̃k(2)=-tgkTsk-1dk-1Tỹk-1*.
Moreover, let us define a vector rk and a scalar δk by
(50)rk∶=υk‖dk‖,δk∶=βk(1)‖dk-1‖‖dk‖,
where
(51)υk=-(1+β̃k*gkTdk-1‖gk‖2)gk+β̃k(2)dk-1.
Therefore, from (17), for k≥1, we obtain
(52)wk=rk+δkwk-1.
Using this relation with the identity ∥wk∥=∥wk-1∥=1, we have that
(53)‖rk‖=‖wk-δkwk-1‖=‖wk-1-δkwk‖.
In addition, using this with the condition δk≥0 and the triangle inequality, we get
(54)‖wk-wk-1‖≤‖wk-δkwk-1‖+‖wk-1-δkwk‖=2‖rk‖.
Now, we evaluate the quantity υk. It follows from the definition of υk in (52) and (21), (39), (40), and (45) that there exists a positive constant D>0 such that
(55)‖υk‖=‖-(1+β̃k*gkTdk-1‖gk‖2)gk+β̃k(2)dk-1‖≤(1+|β̃k*||gkTdk-1|‖gk‖2)‖gk‖+t|gkTsk-1dk-1Tỹk-1*|‖dk-1‖≤(1+|β̃k*||gkTdk-1|‖gk‖2)‖gk‖+t|gkTdk-1dk-1Tỹk-1*|‖sk-1‖≤(1+C2)M+tmax⁡{σ2(1-σ2),1}B≜D.
From the previous relation and Lemma 3, we obtain
(56)∑k≥0‖rk‖2=∑k≥0‖υk‖2‖dk‖2=∑k≥0‖υk‖2‖gk‖4‖gk‖4‖dk‖2≤D2μ4∑k≥0‖gk‖4‖dk‖2<+∞.
Therefore, using this with (54), we complete the proof.LetZ+ denote the set of positive integers. For λ>0 and a positive integer Δ, we define the set (57)Kk,Δλ∶={i∈Z+∣k≤i≤k+Δ-1,‖si-1‖>λ}.
Let |𝒦k,Δλ| denote the number of elements in 𝒦k,Δλ. The following lemma shows that if the gradients are bounded away from zero and Lemma 4 holds, then a certain fraction of the steps cannot be too small. This lemma is equivalent to Lemma 3.5 in [10] and Lemma 4.2 in [28].Lemma 6.
Suppose that all assumptions of Lemma5 hold. Then, there exists constant λ>0 such that, for any Δ∈Z+ and any index k0,  there exists a greater index k≥k0 such that
(58)|Kk,Δλ|>Δ2.Next, making use of Lemmas4, 5, and 6, we can establish the global convergence theorem for Algorithm MDL+-CG under the Wolfe line search for general functions whose proof is similar to that of Theorem 3.6 in [10] and Theorem 4.3 in [28], thus we omit it.Theorem 2.
Suppose that Assumptions1 and 2 hold. If {xk} is obtained by Algorithm MDL+-CG and αk is obtained by the Wolfe line search (23) and (24), then one has either gk=0 for some k or
(59)lim⁡k→∞inf⁡‖gk‖=0.


## 4. Numerical Experiments

In this section, we report numerical experiments which were performed on a set of 73 unconstrained optimization problems. These test problems with the given initial points can be found in Andrei Neculai’s web site (http://camo.ici.ro/neculai/SCALCG/testuo.pdf). Each test function made an experiment with the number of variables 1000, 5000, and 10000, respectively.We evaluate the performance of our proposed conjugate gradient methodMDL+-CG with that of the CG-DESCENT method [16]. The CG-DESCENT code is coauthored by Hager and Zhang obtained from Hager’s web page (http://www.math.ufl.edu/~hager/papers/CG/). The implementation code was written in Fortran and have been compiled with the Intel Fortran compiler ifort (with compiler settings −02 -double-size 128) on a PC (2.66 GHz Quad-Core processor, 4 Gbyte RAM) running Linux operating system. All algorithms were implemented with the Wolfe line search proposed by Hager and Zhang [16] and the parameters were set as default. In our experiments, the termination criterion is ∥gk∥≤10-6 and set u=sk-1 as in [11]. In the sequel, we focus our interest on our experimental analysis for the best value of parameter t; hence, we have tested values of t ranging from 0 to 1 in steps of 0.005. The detailed numerical results can be found in the web site: http://www.math.upatras.gr/~livieris/Results/MDL_results.zip.Figure1 presents the percentage of the test problems that were successfully solved by Algorithm MDL+-CG for each choice of parameter t and Figure 2 presents the multigraph of means with respect to function and gradient evaluations. Algorithm MDL+-CG reports the best results relative to the success rate for choices of t which belong to the interval [0.785,0.825]. Moreover, in case t=0.82, Algorithm MDL+-CG illustrates the highest success rate (98.64%), solving 216 out of 219 of the test problems successfully. Clearly, the interpretation in Figures 1 and 2 presents the influence of parameter t in the computational cost is more sensitive, hence, we focus our attention to the function and gradient evaluations metrics. Based on the experimental results performed on this limited test set we conjecture that the optimal parameter t with respect to the computational cost belongs to the interval [0.02,0.115]. Notice that in case t=0.07, Algorithm MDL+-CG illustrates the least mean number of function and gradient evaluations. Furthermore, for values of t in the intervals [0.32,0.42],[0.61,0.70], and [0.95,1], Algorithm MDL+-CG exhibits its worst performance with respect to the computational cost. It is worth noticing that the choice t=0.995 exhibits the worst performance in terms of computational cost and success rate.Figure 1
Percentage of successfully solved problems by AlgorithmMDL+-CG for each value of parameter t.Figure 2
Multigraph of means with respect to the function evaluations (blue line) and gradient evaluations (red line).We conclude our analysis by considering the performance profiles of Dolan and  Moré [25] for the worst and the best parameter t choices. The use of performance profiles provide a wealth of information such as solver efficiency, robustness, and probability of success in compact form and eliminate the influence of a small number of problems on the benchmarking process and the sensitivity of results associated with the ranking of solvers [25]. The performance profile plots the fraction P of problems for which any given method is within a factor τ of the best method. The horizontal axis of the figure gives the percentage of the test problems for which a method is the fastest (efficiency), while the vertical axis gives the percentage of the test problems that were successfully solved by each method (robustness). The curves in Figures 3 and 4 have the following meaning.(i)
“CG-DESCENT” stands for the CG-DESCENT method.(ii)
“MDL1+” stands for Algorithm MDL+-CG with t=0.07.(iii)
“MDL2+” stands for Algorithm MDL+-CG with t=0.82.(iv)
“MDL3+” stands for Algorithm MDL+-CG with t=0.995.Figure 3
Performance profiles of CG-DESCENT,MDL1+, MDL2+ and MDL3+ based on function evaluations.Figure 4
Performance profiles of CG-DESCENT,MDL1+, MDL2+ and MDL3+ based on gradient evaluations.Figures3–5 present the performance profiles of CG-DESCENT, MDL1+MDL2+, and MDL3+ relative to the function evaluations, gradient evaluations, and CPU time (in seconds), respectively. Obviously, MDL1+ exhibits the best overall performance, significantly outperforming all other conjugate gradient methods, relative to all performance metrics. More analytically, MDL1+ solves about 64.4% and 66.2% of the test problems with the least number of function and gradient evaluations, respectively, while CG-DESCENT solves about 48.8% and 47%, in the same situations. Moreover, MDL2+ is more robust than the CG-DESCENT since it solves 55.3% and 53% of the test problems with the least number of function and gradient evaluations, respectively. As regarding the CPU time metric, the interpretation in Figure 5 illustrates that MDL1+ reports the best performance, followed by MDL2+. More specifically, MDL1+ solves 68.4% of the test problems with the least CPU time while MDL2+ solves about 58% of the test problems. In terms of efficiency, MDL2+ and CG-DESCENT exhibit the best performance, successfully solving 216 out of 219 of the test problems. MDL3+ presents the worst performance, since its curves lie under the curves of the other conjugate gradient methods, regarding all performance metrics. In summary, based on the performance of MDL1+,MDL2+ and MDL3+, we point out that the choice of parameter t crucially affects the efficiency of Algorithm MDL+-CG.Figure 5
Performance profiles of CG-DESCENT,MDL1+, MDL2+ and MDL3+ based on CPU time.


## 5. Conclusions and Future Research

In this paper, we proposed a conjugate gradient method which consists of a modification of Dai and Liao method. An important property of our proposed method is that it ensures sufficient descent independence of the accuracy of the line search. Moreover, it achieves a high-order accuracy in approximating the second-order curvature information of the objective function by utilizing the modified secant condition proposed by Babaie-Kafaki et al. [11]. Under mild conditions, we establish that the proposed method is globally convergent for general functions under the Wolfe line search conditions.The preliminary numerical results show that if we choose a good value of parametert, our proposed algorithm performs very well. However, we have not theoretically established an optimal parameter t, yet which consists our motivation for future research. Moreover, an interesting idea is to apply our proposed method to a variety of challenging real-world problems such as protein folding problems [29].



---

*Source: 435495-2012-03-13.xml*