期刊文献+

双稳定束方法以及收敛性分析 被引量:1

Doubly stabilized bundle method and its convergence
下载PDF
导出
摘要 对于带有非线性约束的非光滑优化问题,束方法是最常用且最有效的方法之一。在目前众多束方法中,双稳定束方法是结合迫近束方法与水平束方法产生的一种新算法,在数值计算中更加具有优势,而且具有很高的理论研究价值。主要研究双稳定性束方法及其收敛性。首先将双稳定束方法的子问题在新范数意义下应用对偶思想进行求解,得到与原范数意义下求解相类似的结果。接下来在已经求得新范数意义下解的基础上,对算法收敛性做进一步分析,即在一般迫近束方法算法的框架下讨论收敛性。假设算法不终止,无论产生无限多下降步,还是有限多下降步,不仅得到迭代序列的相应收敛结果,同时也得到了与单纯用迫近束方法求解无约束优化问题相类似的性质。 For nonsmooth optimization problems with nonlinear constraints, one of the most commonly used and the most effective methods is the bundle method. In the present bundle methods, the doubly stabilized bundle method is a new algorithm with high theory research value which combines the level bundle method with the proximal bundle method, and it has an obvious advantage in numerical computation. In this paper we try to study the doubly stabilized bundle method and its convergence. Firstly, in application of dual idea under the new norm sense, we solve the sub-problem of the doubly stabilized bundle method and get the similar results with the original norm sense. Then we study further the convergence of the doubly stabilized bundle method in the framework of general bundle algorithm, on the basis of solutions which we have got from solving the sub-problem of the doubly stabilized bundle method under the new norm sense. Assume that the algorithm is never stopped, and no matter there exist an infinite number or a finite number of descent steps, we not only obtain the corresponding results of the convergence of the iterative sequence, but also have similar properties to the case in which only the proximal bundle method is employed to solve the unconstrained optimization problems.
出处 《沈阳师范大学学报(自然科学版)》 CAS 2015年第2期177-180,共4页 Journal of Shenyang Normal University:Natural Science Edition
基金 国家自然科学基金资助项目(11301246)
关键词 切平面 次梯度 惩罚思想 双稳定束方法 收敛性 tangent plane subgradient penalty idea doubly stabilized bundle method convergence
  • 相关文献

参考文献8

  • 1OLIVEIRA W, SAGASTIZd3AL C. Level bundle methods for oracles with on-demand accuracy[J]. Optim Method Softw, 2014,29(6) :1180 - 1209.
  • 2HINTERMVLLER M. A proximal bundle method based on approximate subgradients[J]. Cornput Optim Appl, 2001,20(3) : 245 - 266.
  • 3KIWIEL K C. Efficiency of proximal bundle methods[J]. J Optimiz Theory App, 2000,104(3):589 - 603.
  • 4ACKOOIJ W, OLIVEIRA W. Level bundle methods for constrained convex optimization with various oracles[J]. Comput Optim Appl, 2014,57(3) :555 - 597.
  • 5BRANNLUND U, LINDBERG P O, KIWIEL K C. A descent proximal level bundle method for convexnon- differentiable optimization[J]. Oper Res Lett, 1995,17(3) : 121 - 126.
  • 6FRANGIONI A. Generalized bundle methods[J]. SIAM J Optimiz, 2002,13(1): 117- 156.
  • 7OLIVEIRA W, SOLODOV M. A doubly stabilized bundle method for nonsmooth convex optimization[J]. Math Program, 2015. DOI: 10. 1007/s10107 - 015 - 0873 - 6.
  • 8BONNANS J F, GILBERT J C, CLAUDE L, et al. Numerical Optimization[M]. Berlin:Spring, 2003:117 - 136.

同被引文献5

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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