期刊文献+

非光滑非凸约束优化问题的一种迫近束方法

A proximal bundle method for nonsmooth and nonconvex constrained optimization
下载PDF
导出
摘要 束方法目前被公认为是解决非光滑优化问题的最有效、最有前景的方法之一,已经被成功应用到众多实际问题.利用次梯度局部测度将凸函数迫近束方法推广到非凸的约束优化问题并给出算法.该方法保证即使选取的初始点和迭代过程中的下降步不可行,所产生的序列仍会收敛到原问题的最优解. Now Bundle methods are considered as one of the most efficient and promising methods for solving nonsmooth optimization problems.The methods have already been applied to many practical problems.In this paper,subgradient locality measures will be used to generalize the proximal bundle method of nonconvex constrained optimization.The algorithm will be presented,which will make sure that either the starting point or serious iterates are infeasible,the sequence will converge to the optimal solution.
出处 《辽宁师范大学学报(自然科学版)》 CAS 2011年第4期411-415,共5页 Journal of Liaoning Normal University:Natural Science Edition
基金 国家自然科学基金项目(11171138) 辽宁省教育厅高等学校科研项目(L2010235)
关键词 非光滑最优化 非凸函数 次梯度局部测度 束方法 nonsmooth optimization nonconvex function subgradient locality measures bundle methods
  • 相关文献

参考文献6

  • 1FRANGIONI A. Generalized bundle methods[J]. SIAM Journal on Optimization, 2002,13 (1) : 117-156.
  • 2CORREA R, LEMARECHAL C. Convergence of some algorithms for convex minimization[J]. Mathematical Programming,1993, 62:262-275.
  • 3LUKSAN ladislav, VLCEK Jan. Algorithms for Nondifferentiable Optimization[J]. 2001,27(2) : 199-200.
  • 4KIWIEL K C. Methods of Descent for Nondifferentiable Optimization(Lecture Notes in Mathematics)[M]. Berlin, Germany: Springer-Verlag, 1985.
  • 5MIFLIN R. An algorithm for constrained optimization with semismooth functions[J].Mathematics of Operations Research, 1997, 2 : 191-207.
  • 6SAGASTIZABAL Claudia, SOLODOV Mikhail. An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or filter. 2005,16(1) :146-169.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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