Altiparmak, EbruJolaoso, Lateef OlakunleKarahan, IbrahimRehman, Habib ur2026-03-262026-03-2620250233-19341029-494510.1080/02331934.2024.23584122-s2.0-85194742048https://doi.org/10.1080/02331934.2024.2358412https://hdl.handle.net/20.500.14901/3226Jolaoso, Lateef/0000-0002-4838-7465;In this study, we define two pre-conditioning CQ algorithms for the split feasibility problem by using self-adaptive and line-search techniques in the real Hilbert space. One of the self-adaptive techniques is used to obtain optimal step size. These techniques do not require prior knowledge of the operator norm or estimation of the matrix norm. We also establish weak convergence theorems with respect to particular norms. As an application, numerical experiments show that the proposed algorithm is effective in image restoration problem.eninfo:eu-repo/semantics/closedAccessSplit Feasibility ProblemImage Restoration ProblemPre-Conditioning CQ AlgorithmLine Search TechniqueSelf-Adaptive TechniqueArticle