[1]
|
J. J. Moré and D. C. Sorensen, “Computing a Trust Region Step,” SIAM Journal on Scientific and Statistical Computing, Vol. 4, No. 3, 1983, pp. 553-572. doi:10.1137/0904038
|
[2]
|
M. J. D. Powell, “Convergence Properties of a Class of Minimization Algorithms,”O. L. Mangasarian, R. R. Meyer and S. M. Robinson eds. , Nonlinear Programming, Academic Press, New York, 1975, pp. 1-27.
|
[3]
|
R. Fletcher, “Practical Methods of Optimization, John Wiley and Sons,” New York, 1987.
|
[4]
|
A. R. Conn, N. I. M. Gould and Ph. L. Toint, “Trust-Region Methods,” SIAM, Philadelphia, 2000. doi:10.1137/1.9780898719857
|
[5]
|
G. X. Ma, “A Modified Trust Region Methods for Unconstrained Optimization (in Chinese),” Master's Thesis, 2003.
|
[6]
|
Q. H. Zhou, Y. R. Zhang, F. X. Xu and Y. Geng, “An Improved Trust Region Method for Unconstrained Optimization,” accepted by Science China Mathematics.
|
[7]
|
J. Nocedal and Y. Yuan, “Combining Trust Region and Line Search, Y. Yuan, ed.,” Advances in Nonlinear Programming, Kluwer, 1998, pp. 153-175.
|
[8]
|
J. J. Moré, B. S. Garbow and K. H. Hillstrom, “Testing Unconstrained Optimization Software,” ACM Transaction Mathematics, Vol. 7, No. 1, 1981, pp. 17-41.
|