On the Rate of Superlinear Convergence of a Class of Variable Metric Methods.
Technical Summary rept.,
WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER
Pagination or Media Count:
This paper considers a class of variable metric methods for unconstrained minimization. Without requiring exact line searches each algorithm in this class converges globally and superlinearly. Various results on the rate of the superlinear convergence are obtained. Author
- Operations Research