参考
[1] Broyden, C. G. “The Convergence
of a Class of Double-Rank Minimization Algorithms.” Journal
Inst. Math. Applic., Vol. 6, 1970, pp. 76–90.
[2] Coleman, T. F. and Y. Li. “An Interior,
Trust Region Approach for Nonlinear Minimization Subject to Bounds.” SIAM
Journal on Optimization, Vol. 6, 1996, pp. 418–445.
[3] Coleman, T. F. and Y. Li. “On the
Convergence of Reflective Newton Methods for Large-Scale Nonlinear
Minimization Subject to Bounds.” Mathematical Programming,
Vol. 67, Number 2, 1994, pp. 189–224.
[4] Davidon, W. C. “Variable Metric
Method for Minimization.” A.E.C. Research and Development
Report, ANL-5990, 1959.
[5] Fletcher, R. “A New Approach to
Variable Metric Algorithms.” Computer Journal,
Vol. 13, 1970, pp. 317–322.
[6] Fletcher, R. “Practical Methods
of Optimization.” Vol. 1, Unconstrained Optimization,
John Wiley and Sons, 1980.
[7] Fletcher, R. and M. J. D. Powell. “A
Rapidly Convergent Descent Method for Minimization.” Computer
Journal, Vol. 6, 1963, pp. 163–168.
[8] Goldfarb, D. “A Family of Variable
Metric Updates Derived by Variational Means.” Mathematics
of Computing, Vol. 24, 1970, pp. 23–26.
[9] Shanno, D. F. “Conditioning of
Quasi-Newton Methods for Function Minimization.” Mathematics
of Computing, Vol. 24, 1970, pp. 647–656.