A GLOBALLY CONVERGENT VERSION OF ROBINSONS ALGORITHM FOR GENERAL NON-LINEAR PROGRAMMING-PROBLEMS WITHOUT USING DERIVATIVES

被引:2
作者
BRAUNINGER, J
机构
关键词
D O I
10.1007/BF00934576
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:195 / 216
页数:22
相关论文
共 11 条
[1]   A GLOBALLY AND QUADRATICALLY CONVERGENT ALGORITHM FOR GENERAL NON-LINEAR PROGRAMMING-PROBLEMS [J].
BEST, MJ ;
BRAUNINGER, J ;
RITTER, K ;
ROBINSON, SM .
COMPUTING, 1981, 26 (02) :141-153
[2]   QUASI-NEWTON METHOD FOR MINIMIZATION UNDER LINEAR CONSTRAINTS WITHOUT EVALUATING ANY DERIVATIVES [J].
BRAUNINGER, J .
COMPUTING, 1979, 21 (02) :127-141
[3]  
BRAUNINGER J, 1978, MODIFICATION ROBINSO
[4]  
BRAUNINGER J, 1977, THESIS U STUTTGART
[5]  
BRAUNINGER J, 1977, METHODS OPERATIONS R, V23, P17
[6]  
COLVILLE AR, 1968, 3202949 IBM N Y SCIE
[7]  
HIMMELBLAU JM, 1972, APPLIED NONLINEAR PR
[8]  
INDUSI JP, 1972, COMPUTER ALGORITHM C
[9]  
Kantorovich LV, 1964, FUNCTIONAL ANAL NORM
[10]  
MCCORMICK GP, 1971, MATHEMATICAL PROGRAM, V1, P217