Two Modified Three-Term Type Conjugate Gradient Methods and Their Global Convergence for Unconstrained Optimization

Table 2

The numerical results of Algorithm 9.

			Nf	Ng
Rosenbrock	2	2	18	18	10
Freudenstein and Roth	2	2	47	48	28.3
Brown badly scaled	2	3	106	108	301.4
Beale	2	3	40	40	31
Brown and Dennis	4	20	23	23	36.4	85822.2
Trigonometrix	100	100	5	5	25
Trigonometrix	1000	1000	20	21	40.3
Trigonometrix	5000	5000	35	35	53.4
Power singular	4	4	45	45	63.2
Broyden tridiagonal	100	100	40	40	68
Broyden tridiagonal	1000	1000	54	54	85.4
Broyden tridiagonal	5000	5000	72	75	130.1
Broyden banded	100	100	7	7	60.7
Broyden banded	500	500	31	35	84.5
Brown almost linear	100	100	25	28	33.5
Brown almost linear	1000	1000	50	50	65.8
Watson	31	31	14	17	75.6
Discrete boundary value	100	100	42	42	30.4
Penalty function I	100	101	55	56	69.1
Penalty function II	100	200	41	41	64.3
Penalty function II	500	1000	56	56	68
Penalty function II	1000	2000	86	86	70.1