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

关于基于近似次梯度的非光滑优化束方法的对偶问题的研究
引用本文:沈洁,顾敏,田佳茜.关于基于近似次梯度的非光滑优化束方法的对偶问题的研究[J].辽宁师范大学学报(自然科学版),2014(2):149-152.
作者姓名:沈洁  顾敏  田佳茜
作者单位:辽宁师范大学数学学院;
基金项目:国家自然科学基金项目(11301246;11171138)
摘    要:利用目标函数值和近似次梯度,构建了非光滑无约束优化问题目标函数的一个下近似模型,通过对该近似模型取极小寻找下一个可能使目标函数值下降的试探点.利用Lagrange函数写出了原近似问题的对偶问题,揭示了原近似问题的最优解与对偶问题最优解之间的关系,并进一步分析了相应的近似次梯度的某种凸组合与目标函数在当前迭代点的次微分以及目标函数的近似模型在当前迭代点的近似次微分之间的所属关系.所得结果为原近似问题的求解开辟了新思路,也使整个外层束方法的执行变得简单易行.

关 键 词:非光滑优化  束方法  Lagrange对偶  近似次梯度  切平面模型

Study on the dual problem of nonsmooth bundle method based on approximate subgradients
SHEN Jie,GU Min,TIAN Jiaqian.Study on the dual problem of nonsmooth bundle method based on approximate subgradients[J].Journal of Liaoning Normal University(Natural Science Edition),2014(2):149-152.
Authors:SHEN Jie  GU Min  TIAN Jiaqian
Institution:(School of Mathematics,Liaoning Normal University,Dalian 116029,China)
Abstract:We construct a lower approximate model for the ohiective function of nonsmooth unconstrained optimization problem by using the values of the objective function and its approximate subgradients. And by minimizing the lower approximate model, we expect to find out a candidate point which can decrease the value of the objective function. After that,the dual problem of the primal ap- proximate problem is given by utilizing Lagrange function,and at the same time the relation between the solutions of the primal approximate problem and the dual problem is also presented. Furthermore,we conclude that some convex combination of previous approximate subgradients belongs to both the subdifferential of the objective function at the current iterate point and the approximate sub- differential of the lower approximate model at the current iterate point. The results obtained in this paper provide a new way to solve the primal problem,and also make the overall outer bundle method easier to implement.
Keywords:nonsmooth optimization  bundle method  Lagrange duality  approximate subgradient  cutting plane model
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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