On the roots of certain polynomials arising from the analysis of the Nelder–Mead simplex method
暂无分享,去创建一个
[1] John A. Nelder,et al. A Simplex Method for Function Minimization , 1965, Comput. J..
[2] Jeffrey C. Lagarias,et al. Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions , 1998, SIAM J. Optim..
[3] Margaret H. Wright,et al. Direct search methods: Once scorned, now respectable , 1996 .
[4] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[5] W. Rogosinski,et al. The Geometry of the Zeros of a Polynomial in a Complex Variable , 1950, The Mathematical Gazette.
[6] Alston S. Householder,et al. The Theory of Matrices in Numerical Analysis , 1964 .
[7] L. Elsner,et al. The effect of the number of processors on the convergence of the parallel block Jacobi method , 1991 .
[8] Lixing Han,et al. Algorithms for unconstrained optimization , 2000 .
[9] A. Householder. The numerical treatment of a single nonlinear equation , 1970 .
[10] Einschliessungssätze für Eigenwerte Gestörter Dreiecksmatrizen , 1974 .