%0 Journal Article
%T GLOBAL CONVERGENCE ANALYSIS OF DFP METHOD<br>DFP算法的全局收敛性分析
%A 徐大川
%J 计算数学
%D 1997
%I 
%X Consider DFP method for unconstrained optimization problems. Under some conditions, we prove the global convergence property of DFP method with Wolfe line search on uniformly convex objective function.
%K 无约束最优化
%K DFP算法
%K 全局收敛性
%K 最佳化
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=CC77F3CEF526D9CF0B3021650FB4E57E&aid=E595C5BA28A53DFCB4F46CE8F1CFE4C0&yid=5370399DC954B911&vid=2A8D03AD8076A2E3&iid=38B194292C032A66&sid=EBD6B792C9111B87&eid=8BB50A069C48D50B&journal_id=0254-7791&journal_name=计算数学&referenced_num=2&reference_num=4