<p>Mixed sparse optimization has been extensively applied in the modeling of many important problems in various disciplines, in which the sparse structure appears as the inter-group and intra-group manners simultaneously. In this paper, we consider the <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\ell _0\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>ℓ</mi> <mn>0</mn> </msub> </math></EquationSource> </InlineEquation> regularization problem for mixed sparse optimization and investigate its consistency theory. In particular, we first introduce the notions of sparse eigenvalue conditions, one of the weakest regularity conditions in the literature, and discuss their relations with the uniquely solvable property and restricted eigenvalue conditions. Then we establish the oracle property without any regularity condition and provide a recovery bound for the global solutions of the <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\ell _0\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>ℓ</mi> <mn>0</mn> </msub> </math></EquationSource> </InlineEquation> regularized mixed sparse optimization problem under the assumption of sparse eigenvalue condition. Moreover, by virtue of the notion of epi-convergence, an asymptotic analysis is provided to advance the understanding of the convergence of the <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\ell _{2,p}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>ℓ</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>p</mi> </mrow> </msub> </math></EquationSource> </InlineEquation> regularization to the <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\ell _{2,0}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>ℓ</mi> <mrow> <mn>2</mn> <mo>,</mo> <mn>0</mn> </mrow> </msub> </math></EquationSource> </InlineEquation> regularization as <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(p\rightarrow 0_+\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo stretchy="false">→</mo> <msub> <mn>0</mn> <mo>+</mo> </msub> </mrow> </math></EquationSource> </InlineEquation>, in terms of regularity condition, global solution set and recovery bound, respectively.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Recovery Bounds for Cardinality Regularized Optimization Problem

  • Carisa Kwok Wai Yu,
  • Yaohua Hu,
  • Minghua Li,
  • Xiaoqi Yang

摘要

Mixed sparse optimization has been extensively applied in the modeling of many important problems in various disciplines, in which the sparse structure appears as the inter-group and intra-group manners simultaneously. In this paper, we consider the \(\ell _0\) 0 regularization problem for mixed sparse optimization and investigate its consistency theory. In particular, we first introduce the notions of sparse eigenvalue conditions, one of the weakest regularity conditions in the literature, and discuss their relations with the uniquely solvable property and restricted eigenvalue conditions. Then we establish the oracle property without any regularity condition and provide a recovery bound for the global solutions of the \(\ell _0\) 0 regularized mixed sparse optimization problem under the assumption of sparse eigenvalue condition. Moreover, by virtue of the notion of epi-convergence, an asymptotic analysis is provided to advance the understanding of the convergence of the \(\ell _{2,p}\) 2 , p regularization to the \(\ell _{2,0}\) 2 , 0 regularization as \(p\rightarrow 0_+\) p 0 + , in terms of regularity condition, global solution set and recovery bound, respectively.