In this study, we derive a new scale parameter φ for the CG method, for solving large scale unconstrained optimization algorithms. The new scale parameter φ satisfies the sufficient descent condition, global convergence analysis proved under Strong Wolfe line search conditions. Our numerical results show that the proposed method is effective and robust against some known algorithms.

1. Introduction

In unconstrained optimization, we minimize an objective function that depends on real variables with no restrictions at all on the value of these variables. The unconstrained optimization problem is stated by:

min x ∈ R n f ( x ) (1)

where x ∈ R n is a real vector with n ≥ 1 component and f : R n → R is a smooth function and its gradient g is available . A nonlinear conjugate gradient method generates a sequence x k Starting from an initial guess x 0 ∈ R n Using the recurrence

x k + 1 = x k + α k d k ,     k = 0 , 1 , 2 , ⋯ (2)

where α k is the positive step size obtained by carrying out a one dimensional search, known as the line searches . Among them, the so-called strong wolf line search conditions require that  .

f ( x k + α k d k ) ≤ f ( x k ) + σ α k d k , (3)

| g ( x k + α k d k ) | ≤ δ | g k T d k | (4)

where 0 < σ < δ < 1 , is to find an approximation of α k where the descent property must be satisfied and no longer searching in the direction when x k is far from the solution. Thus by strong Wolfe line search conditions we in herit the advantages of exact line search with inexpensive and low computational cost .

The search direction d k is generated by:

d k = { − g k ,                           k = 1 − g k + β k d k ,         k > 1 (5)

where g k and β k is the gradient and conjugate gradient coefficient of f(x) respectively at the point x k . The different choices for the parameter β k correspond to different conjugate gradient methods. The most popular formulas for β k is Hestenes Stiefel method (HS), Fletcher-Reeves method (FR), Polak-Ribiere- Polyak method (PR), conjugate―Descent method (CD), Liu―Storey method (LS), and Dai-Yuan method (DY), etc

These methods are identical when f is a strongly convex quadratic function and the line search is exact, since the gradient are mutually orthogonal, and the parameters β k in these methods are equal. When applied to general nonlinear function with inexact line searches, however, the behavior of these methods is marked different . We are going to summarize some well known conjugate gradient method in Table 1.

An important class of conjugate gradient methods is the hybrid conjugate gradient algorithms. The hybrid computational schemes perform better than the classical conjugate gradient methods. They are defined by (2) and (5) where the parameter β k is computed as projections or as convex combinations of different conjugate gradient methods .

We are going to summarize some well known hybrid conjugate gradient method in Table 2.

We propose a new hybrid CG method based on combination of MMWU  and RMAR  conjugate gradient methods for solving unconstrained optimization method with suitable conditions. The corresponding conjugate gradient parameters are

B k M M W U = ‖ g k + 1 ‖ 2 ‖ d k ‖ 2 (6)

and

β k R M A R = ‖ g k + 1 ‖ 2 − ‖ g k + 1 ‖ ‖ d k ‖ g k + 1 T d k ‖ d k ‖ 2 (7)

Some well known conjugate gradient coefficients
NOFormulaAuthors
1β k H S = g k + 1 T y k y k T s kHestenes and Stiefel (HS) 
2β k F R = g k + 1 T g k + 1 g k T g kFletcher and Reeves (FR) 
3β k P R P = g k + 1 T y k g k T g kPolak-Ribiere (PRP)  
4β k C D = g k + 1 T g k + 1 y k T s kConjugate Descent (CD) 
5β k L S = g k + 1 T y k − g k T s kLiu and Storey (LS) 
6β k D Y = g k + 1 T g k + 1 y k T s kDai-Yuan method (DY) 
7β k n e w = g k + 1 T y k d k T y k − α k 2 d k T g k y k T y kAl-Naemi and Hamed 
NOFormulaAuthors
1β k c = ( 1 − θ k ) β k H S + θ k β k D YAndrei 
2β k A c = ( 1 − θ k ) β k P R P + θ k β k D YYan 
3β k N = ( 1 − θ k ) β k F R + θ k β k M M W ULi and Sun 
4β k h y b = ( 1 − θ k ) β k L S + θ k β k D YLiu, J.K. and Li, Sij 
5β k h y b = ( 1 − θ k ) β k L S + θ k β k F RDjordjevic’ 
6 7β k h y b = ( 1 − θ k ) β k H S + θ k β k F R β k h y b = ( 1 − θ k ) β k L S + θ k β k F RDjordjevic’  Djordjevic’ 
8β k c = ( 1 − θ k ) β k H S + θ k β k C DXiuyun, et al. 
9β k L S D Y = ( 1 − γ k ) β k L S + γ k β k D YAbdullahi and Ahmad 
10β k H C G = λ k β k D Y + ( 1 − λ k ) β k H SLivieris, Tampakas, and Pintelas 

We defined the parameter β k in the proposed method by:

β k F G = ( 1 − φ k ) β k M M W U + φ k β k R M A R (8)

Observe that if φ k = 0 , then β k F G = β k M M W U , and if φ k = 1 , then β k F G = β k R M A R .

By choosing the appropriate value of the parameter φ k In the convex combination, the search direction d k of our algorithm not only is the Newton direction, but also satisfies the famous DL conjugate condition proposed by Dai and Liao . Under the strong Wolfe line search conditions, we prove the global convergence of our algorithm. The numerical results also show the feasibility and effectiveness of our algorithm.

This paper is organized as follows. Section 2 we introduce our new hybrid conjugate gradient method (HFG), and we obtain the parameter φ k using some approaches and give us a specific algorithm. Section 3, we prove that it generates direction satisfying the sufficient descent condition under strong Wolfe line search conditions. The global convergence property of the proposed method is established in Section 4. Some numerical results are reported in Section 5.

2. A New Hybrid Conjugate Gradient Method

In this section, we will describe a new proposed hybrid conjugate gradient method. In order to obtain the sufficient descent direction, we will compute φ k as follows. We combine β k M M W U and β k R M A R in a convex combination in order to have a good algorithm for unconstrained optimization.

The direction d k + 1 is generated by the rule

d k + 1 = − g k + 1 + β k H F G d k (9)

where β k H F G defined in (8), the iterates x 1 , x 2 , x 3 , ⋯ of our method are computed by means of the recurrence (2), where the step size α k Is determined according to the strong Wolf conditions (3) and (4).

The scale parameter φ k satisfying 0 ≤ φ k ≤ 1 , which will be determined in a specific way to be described later. Observe that if φ k = 0 , then β k H F G = β k M M W U , and

If φ k = 1 , then β k H F G = β k R M A R . On the other hand, if 0 < φ k < 1 , then β k H F G is a convex combination of β k M M W U and β k R M A R .

From (8) and (9) it is obvious that:

d k + 1 = { − g k + 1 ,                                                                                                                                           k = 1 − g k + 1 + ( 1 − φ k ) ‖ g k + 1 ‖ 2 ‖ d k ‖ 2 d k + φ k ‖ g k + 1 ‖ 2 − ‖ g k + 1 ‖ ‖ d k ‖ g k + 1 T d k ‖ d k ‖ 2 d k ,         k > 1 , (10)

Our motivation to select the parameter φ k in such a manner that the defection d k + 1 given in (10) is equal to the Newton direction d k + 1 N = − ∇ 2 f ( x k + 1 ) − 1 g k + 1 . There for

− ∇ 2 f ( x k + 1 ) − 1 g k + 1 = − g k + 1 + ( 1 − φ k ) ‖ g k + 1 ‖ 2 ‖ d k ‖ 2 d k + φ k ‖ g k + 1 ‖ 2 − ‖ g k + 1 ‖ ‖ d k ‖ g k + 1 T d k ‖ d k ‖ 2 d k (11)

Now multiplying (11) by s k T ∇ 2 f ( x k + 1 ) from the left, we get

− s k T g k + 1 = − s K T ∇ 2 f ( x k + 1 ) g k + 1 + ( 1 − φ k ) ‖ g k + 1 ‖ 2 ‖ d k ‖ 2 s K T ∇ 2 f ( x k + 1 ) d k     + φ k ‖ g k + 1 ‖ 2 − ‖ g k + 1 ‖ ‖ d k ‖ g k + 1 T d k ‖ d k ‖ 2 s k T ∇ 2 f ( x k + 1 ) d k

Therefore, in order to have an algorithm for solving large scale problems we assume that pair ( s k , y k ) satisfies the secant equation

∇ 2 f ( x k + 1 ) s k = y k . (12)

From (12), we get

s k T ∇ 2 f ( x k + 1 ) = y k T .

Denoting φ k F G = φ k we get

− s k T g k + 1 = − y K T g k + 1 + ‖ g k + 1 ‖ 2 ‖ d k ‖ 2 y k T d k + φ k F G ( ‖ g k + 1 ‖ ( g k + 1 T d k ) ‖ d k ‖ 2 ) ( y k T d k )

after some algebra, we get

φ k F G = ( s k T g k + 1 − y k T g k + 1 ) ⋅ ‖ d k ‖ 3 + ‖ g k + 1 ‖ 2 ⋅ ‖ d k ‖ ( y k T d k ) ‖ g k + 1 ‖ ⋅ ( g k + 1 T d k ) ⋅ ( y k T d k ) (13)

Now, we specify a complete hybrid conjugate gradient method (HFG) which posses some nice properties of conjugate gradient and Newton method.

Algorithm HFG

Step 1: Select x 0 ∈ R n , ∈   > 0 , set k = 0 . Compute f ( x 0 ) and g 0 = − ∇ f ( x 0 ) , set d 0 = − g 0 .

Step 2: Test the stopping criteria, i.e. if ‖ g k ‖ ≤   ∈ , then stop.

Step 3: Compute α k by strong Wolfe line search conditions in (3) & (4).

Step 4: Compute x k + 1 = x k + α k d k , g k + 1 = g ( x k + 1 ) . Compute s k = x k + 1 − x k And y k = g k + 1 − g k

Step 5: If φ k ≥ 1 then set φ k = 1 . If φ k ≤ 0 , then set φ k = 0 , otherwise compute φ k as (13).

Step 6: Compute β k F G by (8).

Step 7: Generate d = − g k + 1 + β k F G d k

Step 8: If the restart criteria of Powell | g k T g k | ≥ 0.2 ‖ g k + 1 ‖ 2 , is satisfied, then set d k = − g k + 1 , otherwise define d k + 1 = d

Step 9: Set k = k + 1 , and continue with step 2.

3. The Sufficient Descent Condition

In this section, we are going to apply the following theorem to illustrate that the search direction d k Obtained by hybrid FG satisfies the sufficient descent condition which plays Avit of role in analyzing the global convergence.

For further considerations we need the following assumptions

3.1. Assumption

The level sets S = { x ∈ R n , f ( x n ) } are bounded.

3.2. Assumption

In a neighborhood N of S, the function f is continuously differentiable and its gradient is Lipschitz continuous, i.e., there exists a constant L > 0 , such that

‖ ∇ f ( x ) − ∇ f ( y ) ‖ ≤ L ‖ x − y ‖ ,   ∀ x , y ∈ N

Under these assumptions of if there exists a positive constant ( γ , γ ¯ , ω & ω ¯ ) & such that

γ ¯ ≤ ‖ g k + 1 ‖ ≤ γ     and     ω ¯ ≤ ‖ g k ‖ ≤ ω ,     ∀ x ∈ S .

Theorem.

Let the sequences { g k } and { d k } be generated by a hybrid FG method. Then the search direction d k satisfies the sufficient descent condition:

g k + 1 T d k + 1 ≤ − μ ‖ g k + 1 ‖ 2 ,     ∀ μ ≥ 0 (14)

where μ = 1 − ( E 4 − E 3 ) , with 0 < ( E 4 − E 3 ) < 1 .

Proof. We shall show that d k satisfies the sufficient descent condition holds for k = 0 , the proof is a trivial one, i.e. d 0 = − g 0 and so g 0 T d 0 = − ‖ g 0 ‖ 2 . Now we have

d k + 1 = − g k + 1 + β k F G d k ,

i.e.

d k + 1 = − g k + 1 + [ ( 1 − φ k ) β k M M W U + φ k β k R M A R ] d k

We can rewrite the above direction by the following manner:

d k + 1 = − ( φ k g k + 1 + ( 1 − φ k ) g k + 1 ) + ( ( 1 − φ k ) β k M M W U + φ k β k R M A R ) d k .

So,

d k + 1 = φ k ( − g k + 1 + β k R M A R d k ) + ( 1 − φ k ) ( − g k + β k M M W U d k ) ,

After some arrangement, we get

d k + 1 = φ k d k + 1 R M A R + ( 1 − φ k ) d k + 1 M M W U (15)

Multiplying (15) by g k + 1 T from the left, we get

g k + 1 T d k + 1 = φ k g k + 1 T d k + 1 R M A R + ( 1 − φ k ) g k + 1 T d k M M W U

Firstly, if φ k = 0 , then d k + 1 = d k + 1 M M W U , we are going to prove that the sufficient descent condition holds for MMWU method in the presence of the strong Wolfe line search condition, because in  they proved this method satisfied the sufficient descent condition with exact line search.

i.e.

g k + 1 T d k + 1 M M W U = − ‖ g k + 1 ‖ 2 + ‖ g k + 1 ‖ 2 ‖ d k ‖ 2 g k + 1 T d k (16)

Since,

g k + 1 T d k ≤ y k T d k and y k T d k ≤ α k L ‖ d k ‖ 2 (17)

Applications (17) in (16), we get

g k + 1 T d k + 1 M M W U ≤ − ‖ g k + 1 ‖ 2 + ‖ g k + 1 ‖ 2 ‖ d k ‖ 2 α k L ‖ d k ‖ 2 = − ( 1 − α k L ) ‖ g k + 1 ‖ 2 = − E 1 ‖ g k + 1 ‖ 2 (18)

where E 1 = ( 1 − α k L ) > 0 , with 0 < α k L < 1 .

So, it is proved that d k + 1 M M W U satisfies the sufficient descent condition.

Now let φ k = 1 then d k = d k R M A R , we are going to prove that the sufficient descent condition holds for RMAR method in the presence of the strong Wolfe line search condition because in  they proved this method satisfied the sufficient descent condition with exact line search.

d k + 1 R M A R = − g k + 1 + β k R M A R d k

Multiplying the above equation from left by g k + 1 T we get

g k + 1 T d k + 1 R M A R = − ‖ g k + 1 ‖ 2 + ‖ g k + 1 ‖ 2 − ‖ g k + 1 ‖ ‖ d k ‖ g k + 1 T d k ‖ d k ‖ 2 g k + 1 T d k .

In , they proved that

0 ≤ ‖ g k + 1 ‖ 2 − ‖ g k + 1 ‖ ‖ d k ‖ g k + 1 T d k ‖ d k ‖ 2 ≤ 2 ‖ g k + 1 ‖ 2 ‖ d k ‖ 2 (19)

Used (17), and (19) the direction become

g k + 1 T d k + 1 ≤ − ‖ g k + 1 ‖ 2 + 2 α k L ‖ g k + 1 ‖ 2 = − ( 1 − 2 α k L ) ⋅ ‖ g k + 1 ‖ 2 = − E 2 ⋅ ‖ g k + 1 ‖ 2 (20)

where E 2 = ( 1 − 2 α k L ) > 0 with 0 < 2 α k L < 1 and 0 < L < 1 2 .

So, it is proved that d k + 1 R M A R satisfied the sufficient descent condition.

Now, we are going to prove the direction satisfy the sufficient descent condition when 0 < φ k < 1 , firstly for

( 1 − φ k ) β K M M W U g k + 1 T d k = ‖ g k + 1 ‖ 2 ‖ d k ‖ 2 g k T d k − [ s k T g k + 1 ‖ d k ‖ 3 − y k T g k + 1 ‖ d k ‖ 3 + ‖ g k + 1 ‖ 2 ‖ d k ‖ y k T d k ‖ g k + 1 ‖ ( g k + 1 T d k ) y k T d k ] ∗ ‖ g k + 1 ‖ 2 ‖ d k ‖ 2 g k + 1 T d k

We have from Lipschitz condition g k + 1 T d k < y k T d k and

− ( 1 − σ ) ‖ g k ‖ ≤ y k T d k ≤ α k L ‖ d k ‖ 2

with a mathematical calculation, we get

( 1 − φ k ) β k M M W U g k + 1 T d k ≤ [ α k L ‖ d k ‖ 2 ‖ d k ‖ 2 − ‖ s k ‖ ‖ g k + 1 ‖ ‖ d k ‖ − α k L ‖ d k ‖ 2 + ‖ g k + 1 ‖ 2 α k L ‖ d k ‖ ‖ g k + 1 ‖ ⋅ ( − ( 1 − σ ) ‖ g k ‖ ) ] ‖ g k + 1 ‖ 2 ≤ [ α k L + L ( 1 − σ ) ‖ s k ‖ 2 ‖ d k ‖ − α k L ‖ d k ‖ 3 + ‖ g k + 1 ‖ 2 ‖ d k ‖ ‖ g k + 1 ‖ ‖ g k ‖ 2 ] ‖ g k + 1 ‖ 2 ≤ [ α k L + A γ B − α k L B 2 + Y 2 α k L B ( 1 − σ ) Y ¯ W ¯ 2 ] ‖ g k + 1 ‖ 2

Let E 1 = α k L + L A B − α k L B 3 + γ 2 α k L B ( 1 − σ ) γ ¯   ω ¯ 2

∴   ( 1 − φ k ) β M M W U g k + 1 T d k ≤ E 3 ‖ g k + 1 ‖ 2 (21)

Now, secondly for

φ k β k R M A R g k + 1 T d k = [ s k T g k + 1 ‖ d k ‖ 3 − y k T g k + 1 ‖ d k ‖ 3 + ‖ g k + 1 ‖ 2 ‖ d k ‖ y k T ‖ d k ‖ ‖ g k + 1 ‖ ( g k + 1 T d k ) ( y k T d k ) ]         ⋅ [ ‖ g k + 1 ‖ 2 − ‖ g k + 1 ‖ ‖ d k ‖ g k + 1 T d k ‖ d k ‖ 2 ] g k + 1 T d k

From (19), Lipschitz condition s k T g k + 1 ≤ y k T s k ≤ L ‖ s k ‖ 2 and s k = α k d k , we get

φ k β k R M A R g k + 1 T d k = 2 [ L ‖ s k ‖ 2 ‖ d k ‖ − ‖ y k ‖ ‖ g k + 1 ‖ ‖ d k ‖ 3 + α k L ‖ g k + 1 ‖ 2 ‖ d k ‖ 2 ‖ g k + 1 ‖ 2 ( − ( 1 − σ ) ) ‖ g k ‖ 2 ‖ d k ‖ 2 ] ⋅ ‖ g k + 1 ‖ 2

Since ‖ y k ‖ ≤ ‖ g k + 1 ‖ + ‖ g k ‖ , so

φ k β k R M A R g k + 1 T d k ≤ − 2 1 − σ [ L ‖ s k ‖ 2 ‖ d k ‖ − 0.8 ‖ g k + 1 ‖ 2 ‖ d k ‖ + α k L ‖ g k + 1 ‖ 2 ‖ d k ‖ ‖ g k + 1 ‖ 2 ‖ g k ‖ 2 ] ⋅ ‖ g k + 1 ‖ 2 ≤ − 2 B 1 − σ [ L A − 0.8 γ 2 + α k L ω 2 γ ¯   ω ¯ 2 ] ⋅ ‖ g k + 1 ‖ 2

where E 4 = 2 B 1 − σ [ L A − 0.8 γ 2 + α k L ω 2 γ ¯   ω ¯ 2 ]

∴   φ k β k R M A R g k + 1 T d k ≤ − E 4 ‖ g k + 1 ‖ 2 (22)

From (18), (20), (21) and (22) we get

g k + 1 T d k + 1 ≤ − ‖ g k + 1 ‖ 2 + E 3 ‖ g k + 1 ‖ 2 − E 4 ‖ g k + 1 ‖ 2 = − [ 1 − ( E 4 − E 3 ) ] ‖ g k + 1 ‖ 2 = − E ‖ g k + 1 ‖ 2

with E = 1 − ( E 4 − E 3 ) and 0 < E 4 − E 3 < 1 .

So, it is proved that d k + 1 Satisfied the sufficient descent condition.

4. Converge Analysis

Let Assumption 2.1 and 2.2 hold. In  it is proved that for any conjugate gradient method with strong Wolfe line search conditions, it holds:

4.1. Lemma

Let Assumption 2.1 and 2.2 holds. Consider the method (2) and (5) where the d k Is a descent direction and αk is received from the strong wolf line search. If

∑ k ≥ 1 1 ‖ d k ‖ 2 = ∞ .

Then

lim k → ∞ inf ‖ g k ‖ = 0 .

4.2. Theorem

Suppose that assumption 2.1 and 2.2 holds. Consider the algorithm HFG were 0 ≤ φ k ≤ 1 and α k is obtained by the strong Wolfe line search and d k + 1 is the descent direction. Then

lim k → ∞ inf ‖ g k ‖ = 0 .

Proof. Because the descent condition holds, we have. So using lemma 3.1, it is sufficient to prove that is bounded above. From (10).

They proved that in  and .

,

And

.

Now for

,

By (4), we have.

Since and

,

with some mathematical calculation, we get

5. Numerical Experiments

In this section we selected some of test functions in Table 3 from CUTE library, along with other large scale optimization problems presented in Andrei   and Bongartz et al. .

All codes are written in double precision FORTRAN Language and compiled Visual F90 (default compiler settings) on a Workstation Intel Pentium 4. The value of is always computed by cubic fitting procedure.

We selected 26 large scale unconstrained optimization problems in the extended

nTest FunctionDimension (N)
Total NOITotal NOFTotal NOITotal NOFTotal NOITotal NOF
1Beal1000 5000 10,00012 12 1229 29 2912 12 1229 29 2912 12 1229 29 29
2Biggsb11000 5000 10,000F 32 241F 71 511F 32 241F 71 511F 32 240F 71 506
3Cosine1000 5000 10,00010 11 1122 27 2810 11 1122 27 2810 11 1122 27 28
4Cubic1000 5000 10,00016 16 1645 45 4516 16 1645 45 4516 16 1645 45 45
5Denschnb1000 5000 10,0006 6 615 15 156 6 615 15 156 6 615 15 15
6Denschnf1000 5000 10,00012 13 1526 28 3112 13 1526 28 3112 13 1526 28 31
7Diagonal11000 5000 10,00032 F 9371 F 24232 52 F71 123 F32 51 9271 121 236
8DiagonalI31000 5000 10,00024 54 8449 110 18424 54 8449 110 17524 53 8349 108 170
9Diagonal41000 5000 10,0002 2 26 6 62 2 26 6 62 2 26 6 6
10Dixmaan A1000 5000 10,0006 6 515 15 136 6 515 15 136 6 515 15 13
11Dixmaan E1000 5000 10,00043 68 115112 193 33543 68 116112 193 33843 68 111112 193 305
12Dixmaan I1000 5000 10,00043 68 111117 191 32743 F F117 F F43 65 110117 173 322
13Dqdrtic1000 5000 10,00032 32 3265 65 6532 32 3265 65 6532 32 3265 65 65
14Extended EP1function1000 5000 10,0004 4 410 10 104 4 410 10 104 4 410 10 10
15Extended cliff1000 5000 10,0006 6 629 29 296 6 629 29 296 6 629 29 29
16Exhimmelbau1000 5000 10,00026 8 8276 1138 39026 8 8276 416 40024 7 7268 382 278
17Ex tri21000 5000 10,00049 57 44150 1372 23546 50 58129 314 93545 46 41103 339 340
18Ex Wood1000 5000 10,000248 210 207503 427 421220 200 204447 407 416161 166 171329 339 349
19Hager1000 5000 10,00026 29 7754 59 536026 29 F53 62 F26 29 7054 59 263
20Helical1000 5000 10,00065 68 68134 140 14058 58 58121 121 12143 43 4390 90 90
21Miele1000 5000 10,000134 141 145510 549 569146 150 160521 543 593108 120 108368 419 369
22Nond1000 5000 10,00030 30 3078 78 7830 30 3078 78 7830 30 3078 78 78
23OSP1000 5000 10,000197 329 401758 1159 1353195 298 386714 1041 1342149 297 383540 1011 1318
24Powell 31000 5000 10,00031 32 3266 68 6827 28 2858 61 6126 27 2756 58 58
25Powell41000 5000 10,000F F FF F F212 293 293485 660 660197 230 230483 530 530
26Wood1000 5000 10,000204 266 246415 539 499266 237 243539 481 493175 177 191357 361 389
The percentage performance of the proposed methods
Measures
NOI100%99.2%71.3%
NOF100%92.4%60.0%

or generalized form. Each problem was tested three times for a gradually increasing number of variables: N = 1000, 5000 and 10,000, all algorithms implemented the strong Wolfe line search (3) and (4) conditions with and and the same stopping criterion is used.

In some cases, the computation stopped due to the failure of the line search to find the positive step size, and thus it was considered as a failure denoted by (F).

We record the number of iteration calls (NOI), the number of function evaluations calls (NOF), and the dimensions of test problems calls (N), for the purpose of our comparisons.

Table 3 gives the comparison depending in the NOI and NOF between, and the proposed method.

Table 4 gives the percentage performance of the proposed methods against and. We have seen that. Method saves (NOI 0.8%), (NOF 7.6%), and method saves (NOI 28.7%), (NOF 40.0%) compared with method.

While Figure 1 gives the comparison between, and, using a well-known Wood test function.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

Cite this paper

Al-Namat, F.N. and Al-Naemi, G.M. (2020) Global Convergence Property with Inexact Line Search for a New Hybrid Conjugate Gradient Method. Open Access Library Journal, 7: e6048. https://doi.org/10.4236/oalib.1106048