Skip to content
DraconiticResearch
Search Sources API
186,546 studies31 sourcesUpdated 57 min ago
PreprintCC BY-NC-ND 4.0arXiv

Adaptive relaxed CQ algorithm with dynamic stepsizes for the split feasibility problem

  • Qiao-Li Dong
Open at sourcePDFDOICite

Abstract

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].

Related

  1. Restarted Accelerated Primal-Dual Algorithms with Adaptive Stepsizes for Nonlinear Conic Constrained Convex Optimization
    Necdet Serhat Aybat, Jinxin Wang
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Relaxed Centralized Circumcentered-Reflection Methods for Convex Feasibility: Convergence and Finite Termination
    Vincent Guigues, Roger Behling, Adriana Henarejos
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. Lower Bounds for Adaptive Relaxed Locally Decodable Codes via the Capped Horvitz--Thompson Estimator
    Guy Goldberg, Tom Gur, Sidhant Saraogi
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  4. An Adaptive Multi-Parameter ADMM Algorithm for Embedded MPC
    Alberto Zaupa, Mikael Johansson
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  5. An Adaptive Symplectic Proximal Point Algorithm: Faster Convergence and Improved Numerical Performance
    Yi Zhang
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv

Cite

BibTeXRIS
BibTeX
@misc{dong2026adaptive,
  title = {{Adaptive relaxed CQ algorithm with dynamic stepsizes for the split feasibility problem}},
  author = {Qiao-Li Dong},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.11365},
  eprint = {2610.11365},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.11365},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - Adaptive relaxed CQ algorithm with dynamic stepsizes for the split feasibility problem
AU  - Qiao-Li Dong
PY  - 2026
DA  - 2026/10/08
PB  - arXiv
DO  - 10.48550/arxiv.2610.11365
UR  - https://arxiv.org/abs/2610.11365
AB  - 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].
ER  -