论文信息 - ASCIM - an accelerated constrained simplex technique - 字舞流文

ASCIM - an accelerated constrained simplex technique

L. C. W. Dixon | L. Dixon

[1] C. G. Broyden. The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations , 1970 .

[2] D. Goldfarb,et al. Conjugate Gradient Method for Nonlinear Programming Problems with Linear Constraints , 1968 .

[3] G. W. Stewart,et al. A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives , 1967, JACM.

[4] M. J. Box. A New Method of Constrained Optimization and a Comparison With Other Methods , 1965, Comput. J..

[5] John A. Nelder,et al. A Simplex Method for Function Minimization , 1965, Comput. J..

[6] M. J. D. Powell,et al. An efficient method for finding the minimum of a function of several variables without calculating derivatives , 1964, Comput. J..

[7] Roger Fletcher,et al. A Rapidly Convergent Descent Method for Minimization , 1963, Comput. J..

[8] S. M. Roberts,et al. The Gradient Method in Process Control , 1961 .

[9] Charles W. Carroll. The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems , 1961 .

[10] Robert Hooke,et al. `` Direct Search'' Solution of Numerical and Statistical Problems , 1961, JACM.

[11] H. H. Rosenbrock,et al. An Automatic Method for Finding the Greatest or Least Value of a Function , 1960, Comput. J..