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

信赖域共轭梯度法求解二次规划逆问题
引用本文:高雷阜,陈 曦,于冬梅.信赖域共轭梯度法求解二次规划逆问题[J].计算机工程与应用,2014,50(1):41-44.
作者姓名:高雷阜  陈 曦  于冬梅
作者单位:辽宁工程技术大学 理学院,辽宁 阜新 123000
基金项目:辽宁省教育厅基金(No.L2012105).
摘    要:为了有效地求解二次规划逆问题,提出了一种求解其对偶问题的子问题的光滑化信赖域共轭梯度法。该方法采用增广拉格朗日法求解其对偶问题,引入光滑函数将对偶问题的子问题转换成连续的无约束优化问题,将信赖域法与共轭梯度法结合,设计出求解二次规划逆问题的算法流程。数值实验结果表明,该方法可行且有效,与牛顿法相比,更适合求解大规模问题。

关 键 词:二次规划  逆问题  光滑函数  信赖域共轭梯度法  

Trust-region Newton-CG method for inverse quadratic programming problems
GAO Leifu,CHEN Xi,YU Dongmei.Trust-region Newton-CG method for inverse quadratic programming problems[J].Computer Engineering and Applications,2014,50(1):41-44.
Authors:GAO Leifu  CHEN Xi  YU Dongmei
Affiliation:College of Science, Liaoning Technical University, Fuxin, Liaoning 123000, China
Abstract:In order to solve inverse quadratic programming problems effectively, a smoothing trust region Newton-CG method to solve its dual sub problem is proposed. Augmented Lagrange method is used to solve the dual problem and then the dual sub problem is conversed into a continuous unconstrained optimization problem through introducing a smoothing function. The trust region method and the conjugate gradient method are combined to design the algorithm flow of inverse quadratic programming problems. It is proved that this method is effective by numerical experiments, and compared with Newton method, it is more suitable for solving large scale problems.
Keywords:quadratic programming  inverse programming problems  smooth function  trust-region Newton-CG method
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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