A FAST AND ROBUST UNCONSTRAINED OPTIMIZATION METHOD REQUIRING MINIMUM STORAGE

被引:10
作者
LE, D [1 ]
机构
[1] UNIV NEW S WALES,DEPT MECH & IND ENGN,KENSINGTON,NSW 2033,AUSTRALIA
关键词
D O I
10.1007/BF01585658
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
27
引用
收藏
页码:41 / 68
页数:28
相关论文
共 26 条
[1]  
Beale E.M.L., 1972, NUMER METHODS NONLIN, P39
[2]  
Biggs M. C., 1973, Journal of the Institute of Mathematics and Its Applications, V12, P337
[4]  
Brent, 1973, ALGORITHMS MINIMISAT
[5]  
BRODLIE KW, 1977, MATH PROGRAM, V12, P344, DOI 10.1007/BF01593802
[6]   COMBINED CONJUGATE-GRADIENT QUASI-NEWTON MINIMIZATION ALGORITHM [J].
BUCKLEY, AG .
MATHEMATICAL PROGRAMMING, 1978, 15 (02) :200-210
[7]  
COLVILLE AR, 1968, IBM3202949 NEW YORK
[8]   LINEAR CONVERGENCE OF CONJUGATE GRADIENT METHOD [J].
CROWDER, H ;
WOLFE, P .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1972, 16 (04) :431-&
[9]   OPTIMALLY CONDITIONED OPTIMIZATION ALGORITHMS WITHOUT LINE SEARCHES [J].
DAVIDON, WC .
MATHEMATICAL PROGRAMMING, 1975, 9 (01) :1-30
[10]   FUNCTION MINIMIZATION BY CONJUGATE GRADIENTS [J].
FLETCHER, R ;
REEVES, CM .
COMPUTER JOURNAL, 1964, 7 (02) :149-&