A penalty decomposition method for the optimization problem with two 0-norm constraints

被引:0
|
作者
Li, Hongtao [1 ]
Zhu, Wenxing [1 ]
机构
[1] Fuzhou Univ, Ctr Discrete Math & Theoret Comp Sci, Fuzhou 350108, Peoples R China
基金
中国国家自然科学基金;
关键词
l(0)-norm; sparsity control; block coordinate descent method; penalty decomposition;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we extend the l(0) minimization problem to a special sparse approximation problem in which contains two l(0)-norm constraints to control the sparsities of different parts of the solution. We introduce the first-order optimality conditions for this problem, and propose a penalty decomposition algorithm to solve this problem. We prove that our algorithm can find a local minimizer of the problem under some suitable assumptions.
引用
收藏
页码:7 / 15
页数:9
相关论文
共 50 条
  • [1] Channel pruning for convolutional neural networks using /0-norm constraints☆
    Chen, Enhao
    Wang, Hao
    Shi, Zhanglei
    Zhang, Wei
    NEUROCOMPUTING, 2025, 636
  • [2] A penalty decomposition method for rank minimization problem with affine constraints
    Jin, Zheng-Fen
    Wan, Zhongping
    Zhao, Xiaoke
    Xiao, Yunhai
    APPLIED MATHEMATICAL MODELLING, 2015, 39 (16) : 4859 - 4870
  • [3] Two Conditions for Equivalence of 0-Norm Solution and 1-Norm Solution in Sparse Representation
    Li, Yuanqing
    Amari, Shun-ichi
    IEEE TRANSACTIONS ON NEURAL NETWORKS, 2010, 21 (07): : 1189 - 1196
  • [4] An 0-Norm Optimization-Based Algorithm for Robust and Efficient MIMO Localization
    Shi, Zhang-Lei
    Xiong, Wenxin
    Li, Xiao-Peng
    Li, Weiguo
    Fu, Yaru
    So, Hing Cheung
    IEEE Transactions on Aerospace and Electronic Systems, 2024, 60 (06) : 9418 - 9425
  • [5] A REGULARIZED INEXACT PENALTY DECOMPOSITION ALGORITHM FOR MULTIDISCIPLINARY DESIGN OPTIMIZATION PROBLEM WITH COMPLEMENTARITY CONSTRAINTS
    Lu, Shen
    Kim, Harrison M.
    PROCEEDINGS OF THE ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, VOL 5, PTS A AND B: 35TH DESIGN AUTOMATION CONFERENCE, 2010, : 517 - 527
  • [6] Top-k discriminative feature selection with uncorrelated and t 2 , 0-norm equation constraints
    Wang, Jingyu
    Ma, Zhenyu
    Nie, Feiping
    Li, Xuelong
    NEUROCOMPUTING, 2024, 598
  • [7] Inexact penalty decomposition methods for optimization problems with geometric constraints
    Christian Kanzow
    Matteo Lapucci
    Computational Optimization and Applications, 2023, 85 : 937 - 971
  • [8] Inexact penalty decomposition methods for optimization problems with geometric constraints
    Kanzow, Christian
    Lapucci, Matteo
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2023, 85 (03) : 937 - 971
  • [9] An Inexact Penalty Decomposition Method for Sparse Optimization
    Dong, Zhengshan
    Lin, Geng
    Chen, Niandong
    COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2021, 2021
  • [10] Alternating Direction Method of Multipliers Based on 2,0-norm for Multiple Measurement Vector Problem
    Liu, Zekun
    Yu, Siwei
    arXiv, 2023,