首页 | 本学科首页   官方微博 | 高级检索  
     

一种改进的隐式Euler切线法
引用本文:王希云,贾新辉,王子豪. 一种改进的隐式Euler切线法[J]. 应用数学和力学, 2017, 38(3): 347-354. DOI: 10.21656/1000-0887.370160
作者姓名:王希云  贾新辉  王子豪
作者单位:1太原科技大学 应用科学学院, 太原 030024;2复旦大学 数学科学学院, 上海 200433
基金项目:山西省自然科学基金(2008011013),山西省“131”领军人才工程项目
摘    要:对于Hessian矩阵正定的情形,在求解二次函数模型信赖域子问题的隐式分段折线算法的基础上,提出一种求解信赖域子问题的改进的隐式Euler切线法,并分析该路径的性质.数值实验表明新算法是有效可行的,且较原算法具有迭代次数少、计算时间短等优点.

关 键 词:隐式Euler切线法   信赖域子问题   微分方程模型   无约束优化   信赖域方法
收稿时间:2016-05-23

An Improved Implicit Eulerian Tangent Algorithm
WANG Xi-yun,JIA Xin-hui,WANG Zi-hao. An Improved Implicit Eulerian Tangent Algorithm[J]. Applied Mathematics and Mechanics, 2017, 38(3): 347-354. DOI: 10.21656/1000-0887.370160
Authors:WANG Xi-yun  JIA Xin-hui  WANG Zi-hao
Affiliation:1School of Applied Science, Taiyuan University of Science and Technology, Taiyuan 030024, P.R.China;2School of Mathematical Sciences, Fudan University, Shanghai 200433, P.R.China
Abstract:Based on the implicit piecewise dogleg algorithm for solving trust region subproblems of quadratic models,and aimed at the condition that the Hessian matrix was positive deftnite,an improved implicit Eulerian tangent algorithm for solving trust region subproblems was presented.Then the nature of the path was analyzed.The numerical experiments show that the new algorithm is effective and practicable,and the advantages of the new algorithm compared with the previous algorithms lie in the smaller number of iterations,the shorter computing time and so on.
Keywords:implicit Eulerian tangent algorithm  trust region subproblem  differential equation model  unconstrained optimization  trust region method
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《应用数学和力学》浏览原始摘要信息
点击此处可从《应用数学和力学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号