Scholarlink

<p>This paper addresses the error estimation problem for cosparse signal recovery via non-convex relaxation under noisy conditions. Compared to prior work, we significantly broaden the theoretical guarantees for such recovery by deriving a more inclusive range of admissible parameters in the <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11075_2025_2216_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\({\Omega }\)</EquationSource> </InlineEquation>-RIP framework. Our analysis demonstrates that non-convex methods achieve tighter error bounds than convex approaches. Moreover, the derived error bounds are independent of algorithm design, so the results of this paper are universal and can be widely used in various of the cosparse signal recovery. Through preliminary numerical examples, we show that under <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11075_2025_2216_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\({\Omega }\)</EquationSource> </InlineEquation>-RIP conditions, our non-convex methods achieve tighter bounds compared with convex relaxation methods.</p>

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

Error estimation for non-convex relaxation cosparse optimization problems

  • 期刊论文

  • 发表日期：

    2025年9月23日

查看全文
  • Zisheng Liu,
  • Xu Yang,
  • Jianchao Bai

摘要

This paper addresses the error estimation problem for cosparse signal recovery via non-convex relaxation under noisy conditions. Compared to prior work, we significantly broaden the theoretical guarantees for such recovery by deriving a more inclusive range of admissible parameters in the \({\Omega }\) -RIP framework. Our analysis demonstrates that non-convex methods achieve tighter error bounds than convex approaches. Moreover, the derived error bounds are independent of algorithm design, so the results of this paper are universal and can be widely used in various of the cosparse signal recovery. Through preliminary numerical examples, we show that under \({\Omega }\) -RIP conditions, our non-convex methods achieve tighter bounds compared with convex relaxation methods.