A Frame-Based Conjugate Gradients Direct Search Method with Radial Basis Function Interpolation Model

Table 1

The information about benchmark problems set .

Problem
() Linear (full rank)	9	45
() Linear (rank 1)	7	35
() Linear (rank 1 with 0 columns & rows)	7	35
() Rosenbrock	2	2
() Helical valley	3	3
() Powell singular	4	4
() Freudenstein and Roth	2	2
() Bard	3	15
() Meyer	3	16
() Watson	6	31
() Waston	9	31
() Waston	12	31
() Waston	31	31
() Box  3-dimensional	3	10
() Jennrich and Sampson	2	10
() Brown and Dennis	4	20
() Chebyquad	6	6
() Chebyquad	7	7
() Chebyquad	8	8
() Chebyquad	9	9
() Brown almost-linear	10	10
() Bdqrtic	8	8
() Bdqrtic	10	12
() Bdqrtic	11	14
() Bdqrtic	12	16
() Cube	5	5
() Cube	6	6
() Cube	8	8
() Mancino	5	5
() Mancino	8	8
() Mancino	10	10
() Mancino	12	12
() Penalty II	4	8
() Penalty II	6	12
() Penalty II	8	16
() Penalty II	10	20
() Penalty II	12	24
() Variably dimensioned	8	10
() Variably dimensioned	9	11
() Variably dimensioned	10	12
() Variably dimensioned	11	13
() Variably dimensioned	12	14
() Broyden tridiagonal	6	6
() Broyden tridiagonal	7	7
() Broyden tridiagonal	8	8
() Broyden tridiagonal	9	9
() Broyden tridiagonal	10	10
() Broyden tridiagonal	11	11
() Broyden tridiagonal	12	12
() Broyden banded	4	4
() Broyden banded	7	7
() Broyden banded	9	9
() Broyden banded	10	10
() Broyden banded	11	11
() Linear (full rank)	100	200
() Linear (full rank)	200	400
() Linear (rank 1)	100	200
() Linear (rank 1)	200	400
() Linear (rank 1 with 0 columns & rows)	100	200
() Linear(rank 1 with 0 columns & rows)	200	400
() Chebyquad	100	100
() Chebyquad	200	200
() Brown almost-linear	100	100
() Brown almost-linear	200	200
() Bdqrtic	100	200
() Bdqrtic	200	400
() Cube	100	100
() Cube	200	200
() Mancino	100	100
() Mancino	200	200
() Penalty II	100	200
() Penalty II	200	400
() Variably dimensioned	100	102
() Variably dimensioned	200	202
() Broyden tridiagonal	100	100
() Broyden tridiagonal	200	200
() Broyden banded	100	100
() Broyden banded	200	200