Electronic Resource
Springer
Numerische Mathematik
35 (1980), S. 293-313
ISSN:
0945-3245
Keywords:
AMS (MOS)
;
90C30
;
CR: 5.15
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Summary 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 on convex functions. Various results on the rate of the superlinear convergence are obtained.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01396414
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |