针对分裂可行性问题的带动态步长的自适应松弛CQ算法

中文摘要 AI 辅助

本文针对分裂可行性问题（SFP）提出一种带动态步长的松弛CQ算法，其中松弛参数被自适应选取。我们在标准假设下证明了该算法的弱收敛性，并进一步在SFP的有界线性正则性性质下推导了其线性收敛性。在LASSO问题上的数值结果表明，带动态步长的自适应过松弛CQ算法优于文献[10]中提出的动态CQ算法。

英文摘要

In this paper, we propose a relaxed CQ algorithm with dynamic stepsizes for the split feasibility problem (SFP), where the relaxed parameters are chosen adaptively. We establish the weak convergence of the proposed algorithm under standard assumptions and further derive its linear convergence under the bounded linear regularity property of the SFP. Numerical results on LASSO problem demonstrate that the adaptively over-relaxed CQ algorithm with dynamic stepsizes outperforms the dynamic CQ algorithm proposed in [10].

发表机构

• College of Science, Civil Aviation University of China（中国民航大学理学院）

机构由 AI 辅助整理，请以论文原文为准。