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 条