两个绝对值优化问题解的等价性
DOI:
作者:
作者单位:

作者简介:

通讯作者:

基金项目:


The Equivalence of Solutions of Two Absolute Value Optimization Problems
Author:
Affiliation:

Fund Project:

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

    针对损失函数为最小一乘问题,惩罚项由基数函数定义的绝对值优化问题,提出用MCP (Minimax Concave Penalty)非凸正则来连续逼近基数罚,得到一个精确连续的绝对值优化松弛问题。首先,证明了带基数罚的绝对值优化问题的全局最优解;其次,研究了带基数罚的绝对值优化问题与带MCP罚的绝对值优化松弛问题之间全局最优解的等价性;最后,证明了在一定的条件下这两个绝对值优化问题具有相同的全局最优解。

    Abstract:

    This paper focuses on the absolute value optimization problem, where the loss function is least absolute deviation and the penalty term is defined by the cardinality function. In order to obtain an exact continuous relaxation problem, we use MCP (minimax concave penalty) to approximate the cardinality penalty. Firstly, we prove the global optimal solution of the absolute value optimization problem with cardinal penalty. Then we discuss the equivalence of the global optimal solution between the absolute value optimization problem with cardinal penalty and the absolute value optimization relaxation problem with MCP penalty. Finally, under some mild conditions, we proved that the two problems have the same optimal solutions.

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

罗孝敏, 彭定涛.两个绝对值优化问题解的等价性[J].重庆工商大学学报(自然科学版),2020,37(5):37-42
LUO Xiao-min, PENG Ding-tao. The Equivalence of Solutions of Two Absolute Value Optimization Problems[J]. Journal of Chongqing Technology and Business University(Natural Science Edition),2020,37(5):37-42

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