arXiv (All)
open access
Adaptive relaxed CQ algorithm with dynamic stepsizes for the split feasibility problem
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- MASFuzzer: Fuzz Driver Generation and Adaptive Scheduling via Multidimensional API Sequences#120582
- Quantum Advantage with Adaptive Shallow Circuits#616704
- Quantum Advantage with Adaptive Shallow Circuits#616204
- Bi-Level optimization for interpolation-based parameter estimation of differential equations#153077
- Choice of parameters for the CERN high intensity RFQ: RFQ2 project#303966
Record · ID 1248645
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive