%0 Journal Article
%T AN EFFICIENT CONJUGATE DIRECTION METHOD FOR UNCONSTRAINED FUNCTION MINIMIZATION<br>一种有效的求解无约束优化问题的共轭方向法
%A 李柏林
%A 陈永
%J 计算数学
%D 1993
%I 
%X Based on the properties of conjugate vecrors, a new algorithm for unconstrained functionminimization is developed. The algorithm belongs to the direct search method and is ? conju-gate direction-type method with the property of quadratic termination. Compared with som pre-viouly developed direct search methods including the convensional modified Powell method,the number of one-dimensional search is reduced to the minimum, i.e. only one search in aniterating cycle. In addition, the algorithm presented is simple in calculation and easy incoding, and has the capability of accelerating along the "ridges". The method is compared with three direct search metheds including the modifiedPowell method on many test problems. Numerical results show the efficiency and robustness ofthe new algorithm.
%K 无约束优化
%K 共轭方向法
%K 最佳化
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=CC77F3CEF526D9CF0B3021650FB4E57E&aid=663AEF8F40DF2BB01D4C2E9B6494792E&yid=D418FDC97F7C2EBA&vid=23CCDDCD68FFCC2F&iid=38B194292C032A66&sid=358F98408588E522&eid=F637763636425CAF&journal_id=0254-7791&journal_name=计算数学&referenced_num=0&reference_num=3