Scholarlink

<p>In this paper, we propose a novel relaxed method in order to solve the split feasibility problem in Hilbert spaces. Our algorithms involve a new strategy where the projection onto the half-space is replaced by the projection onto the intersection of two half-spaces. In addition, our algorithms do not require any prior information about the operator norm. We also establish the weak convergence and strong convergence of the proposed algorithms under standard conditions. Finally, the results of numerical experiments indicate that the proposed algorithm is effective in the LASSO problem.</p>

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

A Novel Relaxed Method for the Split Feasibility Problem in Hilbert Spaces

  • 期刊论文

  • 发表日期：

    2025年3月17日

查看全文
  • Wanrong Zhan,
  • Hai Yu

摘要

In this paper, we propose a novel relaxed method in order to solve the split feasibility problem in Hilbert spaces. Our algorithms involve a new strategy where the projection onto the half-space is replaced by the projection onto the intersection of two half-spaces. In addition, our algorithms do not require any prior information about the operator norm. We also establish the weak convergence and strong convergence of the proposed algorithms under standard conditions. Finally, the results of numerical experiments indicate that the proposed algorithm is effective in the LASSO problem.