Computing a Trust Region Step
暂无分享,去创建一个
[1] S. Goldfeld,et al. Maximization by Quadratic Hill-Climbing , 1966 .
[2] C. Reinsch. Smoothing by spline functions , 1967 .
[3] C. Reinsch. Smoothing by spline functions. II , 1971 .
[4] S. W. Thomas. Sequential estimation techniques for quasi-newton algorithms. , 1975 .
[5] M. Powell. CONVERGENCE PROPERTIES OF A CLASS OF MINIMIZATION ALGORITHMS , 1975 .
[6] Jorge J. Moré,et al. The Levenberg-Marquardt algo-rithm: Implementation and theory , 1977 .
[7] Linus Schrage,et al. A More Portable Fortran Random Number Generator , 1979, TOMS.
[8] J. H. Wilkinson,et al. AN ESTIMATE FOR THE CONDITION NUMBER OF A MATRIX , 1979 .
[9] T. M. Williams,et al. Practical Methods of Optimization. Vol. 1: Unconstrained Optimization , 1980 .
[10] Jorge J. Moré,et al. Algorithm 566: FORTRAN Subroutines for Testing Unconstrained Optimization Software [C5], [E4] , 1981, TOMS.
[11] A. K. Cline,et al. Generalizing the LINPACK Condition Estimator , 1981 .
[12] David M. author-Gay. Computing Optimal Locally Constrained Steps , 1981 .
[13] Jorge J. Moré,et al. Testing Unconstrained Optimization Software , 1981, TOMS.
[14] D. Sorensen. Newton's method with a model trust region modification , 1982 .