论文信息 - The linear algebra of block quasi-newton algorithms - 字舞流文

The linear algebra of block quasi-newton algorithms

D. O’Leary | A. Yeremin

[1] R. H. Chan. Iterative methods for overflow queueing models I , 1987 .

[2] R. Chan. Iterative methods for overflow queuing models II , 1988 .

[3] N. Higham,et al. Componentwise perturbation theory for linear systems with multiple right-hand sides , 1992 .

[4] Richard H. Byrd,et al. Parallel quasi-Newton methods for unconstrained optimization , 1988, Math. Program..

[5] C. G. Broyden. The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations , 1970 .

[6] Dianne P. O'Leary. Why Broyden's Nonsymmetric Method Terminates on Linear Equations , 1995, SIAM J. Optim..

[7] L. Kaufman. Matrix Methods for Queuing Problems , 1983 .

[8] J. J. Moré,et al. Quasi-Newton Methods, Motivation and Theory , 1974 .

[9] R. Schnabel. Quasi-Newton Methods Using Multiple Secant Equations. , 1983 .

[10] Jorge Nocedal,et al. Representations of quasi-Newton matrices and their use in limited memory methods , 1994, Math. Program..

[11] John Grover Barnes,et al. An Algorithm for Solving Non-Linear Equations Based on the Secant Method , 1965, Comput. J..

[12] William C. Davidon,et al. Optimally conditioned optimization algorithms without line searches , 1975, Math. Program..