约束DC优化的双束法及对偶问题
DOI:
作者:
作者单位:

作者简介:

通讯作者:

基金项目:


Double Bundle Method and Dual Problem for Constrained DC Optimization
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
    摘要:

    针对带有凸不等式约束的非光滑DC优化问题,提出了一种基于罚函数的凸约束DC优化问题双束法,同时也刻画了双束法子问题的对偶问题;首先,利用L1精确罚技巧把凸约束DC优化问题转化成无约束DC优化问题,便于直接对目标函数进行DC分解,然后分别建立了增广目标函数DC分量的凸分段线性近似模型,最后利用Lagrange函数得到了原问题和对偶问题最优解之间的等价关系,说明了利用对偶问题求解搜索方向的可行性和有效性。

    Abstract:

    Aiming at the nonsmooth DC optimization problem with convex inequality constraints,a double bundle method for convex constrained DC optimization problems based on penalty function is proposed. The dual problem of the double bundle method is also described. This method can effectively utilize the explicit convex DC decomposition structure of the nonconvex objective function. Firstly,the L1exact penalty technique is used to transform the convex constrained DC optimization problem into an unconstrained DC optimization problem,which is convenient for DC decomposition of the objective function directly. Then,the convex piecewise linear approximation model of the DC component of the augmented objective function is established,and finally the Lagrange function is used to obtain the equivalence relation between the optimal solution of the original problem and the optimal solution of the dual problem,which illustrates the feasibility and effectiveness of solving the search direction by using the dual problem.

    参考文献
    相似文献
    引证文献
引用本文

杨芳, 陈恩.约束DC优化的双束法及对偶问题[J].重庆工商大学学报(自然科学版),2019,36(6):18-22
YANG Fang, CHEN En. Double Bundle Method and Dual Problem for Constrained DC Optimization[J]. Journal of Chongqing Technology and Business University(Natural Science Edition),2019,36(6):18-22

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2019-11-25
×
2023年《重庆工商大学学报(自然科学版)》影响因子稳步提升