Journal of Pure and Applied Mathematics: Advances and Applications[1] Ali Bouaricha, Tensor methods for large sparse unconstrained
optimization, SIAM J. Optimization 7(3) (1997), 732-756.
[2] Dan Feng and R. B. Schnabel, Tensor methods for equality
constrained optimization, SIAM J. Optimization 6(3) (1996),
653-673.
[3] Jie Han and Guanghui Liu, The general linear search model and
global convergence of BFGS algorithm for unconstrained optimization,
Acta Mathematicae Applicatae Sinica 1 (1995), 112-122.
[4] Dong-Hui Li and Masao Fukushima, On the global convergence of the
BFGS method for non-convex unconstrained optimization problems, SIAM
J. Optimization 11(4) (2001), 1054-1064.
[5] J. J. More, B. S. Garbow and K. E. Hillstrom, Testing
unconstrained optimization software, ACM Trans. Math. Software 7(1)
(1981), 19-31.
[6] Dennis J. J. Moré, Quasi-Newton methods, motivation, and theory,
SIAM Review 19 (1977), 46-89.
[7] J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear
Equations in Several Variables, Academic Press, London, 1971.
[8] M. J. D. Powell, Some global convergence properties of a variable
metric algorithm for minimization without exact line searches,
Nonlinear Programming, SIAM-AMS Proceedings, R.W. Cottle and C. E.
Lemke, eds. 9 (1976), 53-72.
[9] R. B. Schnabel and Ta-Tung Chow, Tensor methods for unconstrained
optimization using second derivatives, SIAM J. Optimization 1(3)
(1991), 293-315.
[10] J. Werner, Uber die global konvergenze von variablemetric
verfahren mit nichtexakter schrittweitenbestimmong, Numer. Math. 31
(1978), 321-334.
[11] Yaxiang Yuan and Wenyu Sun, The Theory and Methods of
Optimization, Science Press, (2001).
