SUPERLINEAR CONVERGENCE OF THE DFP ALGORITHM WITHOUT EXACT LINE SEARCH

被引：0

作者：

濮定国

机构：

[1] Department of Mathematics

[2] Tongji University Shanghai

[3] China

来源：

Acta Mathematicae Applicatae Sinica(English Series) | 2001年 / 03期

关键词：

DFP; line; SUPERLINEAR CONVERGENCE OF THE DFP ALGORITHM WITHOUT EXACT LINE SEARCH;

D O I：

暂无

中图分类号：

O221.2 [非线性规划];

学科分类号：

070105 ; 1201 ;

摘要：

引用

页码：430 / 432

页数：3

共 6 条

[1]

M. J. D. Powell.Some global convergence properties of a variable metric algorithm for minimization without exact line searches. SIAM Journal on Nonlinear Programming . 1976

[2]

M.J.D. Powell.On the Convergence of the Vaiable Metric Algorithm. Journal of the InstituteMathematics and its Applications . 1971

[3]

R.H. Byrd,J. Nocedal,Y. Yuan.Global Convergence of a Class of Quasi-Newton Methods on ConvexProblems. SIAM Journal on Numerical Analysis . 1987

[4]

D. Pu.A Class of DFP Algorithm without Exact Linear Search. Asia Pacific Journal of Operational Research . 1992

[5] THE CONVERGENCE OF BROYDEN ALGORITHMS FOR LC GRADIENT FUNCTION [J].

濮定国 .

Acta Mathematicae Applicatae Sinica(English Series), 2000, (03) :313-319

[6]

D. Pu,W. Yu.On the Convergence Property of the DFP Algorithm. Journal of Annual of OperationsResearch . 1990

← 1 →