TY - JOUR
T1 - Rate of convergence of the generalized newton algorithm using the fixed-point approach
AU - Kalaba, R.
AU - Tishler, A.
AU - Wang, J. S.
PY - 1984/8
Y1 - 1984/8
N2 - This paper shows that the generalized Newton algorithm [GN(r)], developed by Kalaba and Tishler (Ref. 1), can be described as a fixed-point algorithm. In addition to specifying sufficient conditions for convergence of the GN(r), we show that, for r=1, 2, 3, its rate of convergence increases with the order of the derivatives which are used.
AB - This paper shows that the generalized Newton algorithm [GN(r)], developed by Kalaba and Tishler (Ref. 1), can be described as a fixed-point algorithm. In addition to specifying sufficient conditions for convergence of the GN(r), we show that, for r=1, 2, 3, its rate of convergence increases with the order of the derivatives which are used.
KW - Generalized Newton algorithm
KW - fixed-point algorithm
KW - higher-order derivatives
KW - rate of convergence
UR - http://www.scopus.com/inward/record.url?scp=0021474035&partnerID=8YFLogxK
U2 - 10.1007/BF00935005
DO - 10.1007/BF00935005
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0021474035
SN - 0022-3239
VL - 43
SP - 543
EP - 555
JO - Journal of Optimization Theory and Applications
JF - Journal of Optimization Theory and Applications
IS - 4
ER -