FINDING THE GLOBAL MINIMUM OF A FUNCTION OF ONE VARIABLE USING THE METHOD OF CONSTANT SIGNED HIGHER ORDER DERIVATIVES
暂无分享,去创建一个
[1] A. F. Veinott,et al. On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming , 1967 .
[2] J. F. Price,et al. On descent from local minima , 1971 .
[3] Garth P. McCormick,et al. Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..
[4] Garth P. McCormick,et al. Bounding Global Minima with Interval Arithmetic , 1979, Oper. Res..
[5] G. McCormick,et al. Symbolic Factorable SUMT; What is It, How is It Used, , 1979 .
[6] M. Shayan. A methodology for comparing algorithms and a method of computing mth order directional derivatives based on factorable programming , 1980 .