Splitting relaxed s-subgradient projection algorithm for non-convex split feasibility problems

UNIVERSITY POLITEHNICA OF BUCHAREST SCIENTIFIC BULLETIN-SERIES A-APPLIED MATHEMATICS AND PHYSICS（2023）

引用 0|浏览0

暂无评分

摘要

In this paper, we suggest an algorithm based on subgradient projection method for solving non-convex split feasibility problems in finite dimensional spaces. The step size of the proposed sequence is chosen according to Armijo-type line rule. Convergence result is proved under some additional conditions.

查看译文

关键词

nonconvex split feasibility problems, S-subdifferentiable, S-subgradient pro- jection, Armijo-type line rule

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要