期刊文献+

等式约束下一个带线搜索的信赖域算法

A trust region algorithm with line search under equality constraints
下载PDF
导出
摘要 提出了一个等式约束下凸二次规划问题的带强Wolfe线搜索的信赖域算法.该算法利用增广Lagrange函数将约束问题转化为无约束问题,在传统信赖域算法的基础上结合线搜索技术,当试探步失败时不用重解信赖域子问题,减少了计算量.在适当的条件下,证明了此算法的全局收敛性. A new trust region algorithm with strong Wolfe line search for convex quadratic programming under equality constraints is proposed.This method first uses augmented Lagrange function to transform this restraint question into the non-constraint question,and on the basis of traditional trust region method it takes line search instead of resolving the subproblem when the trail step is not successful.This may allow a considerable computational saving.Global convergence is proved under certain conditions.
出处 《郑州轻工业学院学报(自然科学版)》 CAS 2011年第4期117-120,共4页 Journal of Zhengzhou University of Light Industry:Natural Science
关键词 等式约束 强Wolfe线搜索 信赖域算法 增广LAGRANGE函数 全局收敛性 equality constraint strong Wolfe line search trust region algorithm augmented Lagrange function global convergence
  • 相关文献

参考文献6

  • 1Powell M J D. A New Algorithm for Unconstrained Optimization [ C ]//Nonlinear Programming, New York: Academic Press, 1970 : 31 - 66.
  • 2Nocedal J, Yuan Y X. Combining trust region and line search techniques [ C ]//Advances in Nonlinear Programming, Berlin : Kluwer Academic Publishers, 1998 : 153.
  • 3姚升保,施保昌,彭叶辉.一类带线搜索的非单调信赖域算法[J].数学杂志,2003,23(3):290-294. 被引量:34
  • 4李红,焦宝聪.一类带线搜索的自适应信赖域算法[J].运筹学学报,2008,12(2):97-104. 被引量:9
  • 5王宜举,修乃华.非线性规划理论与算法[M].2版.西安:陕西科学技术出版社,2008:25-26.
  • 6袁亚湘 孙文瑜.最优化理论与方法[M].北京:科学技术出版社,2002.96.

二级参考文献18

  • 1柯小伍,韩继业.一类新的信赖域算法的全局收敛性[J].应用数学学报,1995,18(4):608-615. 被引量:31
  • 2Deng N Y, Xiao Y, Zhou F J. A nonmonotonic trust region algorithm[J]. JOTA, 1993,76 : 259~ 285.
  • 3Grippo L, Lamperiello, F. and Lucidi, S. A Nonmonotone Line Search Technique for Newton's Method[J]. SIAM J. Num. Anal. 1986, 23(4): 701~716.
  • 4Jorge Nocedal, Ya-xiang Yuan. Combining Trust Region and Line Search Techniques [J]. Advances in Nonlinear Programming, 1998: 153~175.
  • 5Powell M.J.D. A new algorithm for unconstrained optimization[M], in: J.B.Rosen, O.L.Mangasarian and K.Ritter, eds., Nonlinear Programming, Academic Press, New York, 1970, 31-66.
  • 6Di and Sun. Trust region method for conic model to solve unconstrained optimization[J]. Optimization Methods and Software, 1996, 6: 237-263.
  • 7Zhang X.S., Zhang J.L. and Liao L.Z. An adaptive trust region method and its convergence[J]. Science in China (Series A), 2002, 45: 620-631.
  • 8Sartenaer A. Antomatic determination of an initial trust region in nonlinear Programming[J]. SIAM, Journal on Scientific Computing, 1997, 18: 1788-1803.
  • 9Edward Michael Gertz. Combination trust-region line-search methods for unconstrained optimization[M]. University of California San Diego, 1999.
  • 10Jorge Nocedal, Yuan Yaxiang. Combining Trust Region and Line Search Techniques[M]. in:Y.Yuan,ed., Advances in Nonlinear Programming(Kluwer), 1998, 153-175.

共引文献53

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部