检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:高苗苗 宫恩龙[2] 孙清滢 王真真 杜小雨 GAO Miao-miao;GONG En-long;SUN Qing-ying;WANG Zhen-zhen;DU Xiao-yu(College of Science,China University of Petroleum(Huadong),Qingdao 266580;Qingdao Hotel Management College,Qingdao 266100)
机构地区:[1]中国石油大学(华东)理学院,青岛266580 [2]青岛酒店管理职业技术学院,青岛266100
出 处:《工程数学学报》2018年第5期502-514,共13页Chinese Journal of Engineering Mathematics
基 金:国家自然科学基金(61201455)~~
摘 要:为有效求解大规模无约束优化问题,本文基于信赖域技术和修正拟牛顿方程,同时结合Zhang H.C.策略和Gu N.Z.策略,设计了一种新的非单调共轭梯度算法,应用信赖域技术保证了算法的稳健性和收敛性,并给出了算法的全局收敛性分析.在适当条件下,证明了该算法具有线性收敛性.数值实验表明新算法能够有效求解病态和大规模问题.与单独结合其中一种非单调策略的算法相比,新算法需要较少的迭代次数和运行时间,利用其得到的函数值与最优值更接近.In order to effectively solve the large-scale unconstrained optimization problem,based on the trust region technique and the modified quasi-Newton equation,a new nonmonotone conjugate gradient algorithm is presented by combining Zhang H.C.and Gu N.Z.strategy in this paper.The trust region technique is applied to ensure the robustness and convergence of the algorithm,and the global convergence property of the algorithm is also analyzed.Under some reasonable conditions,it is proved that the proposed algorithm is linear convergent.Numerical examples indicate that the new algorithm can effectively solve ill-conditioned and large-scale problems.Compared with the algorithm that combines one of the non-monotonic strategies,the new algorithm requires fewer iteration numbers and less running time,and the function value obtained by the new algorithm is closer to the optimal value.
分 类 号:O221.2[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.104