Strong Convergence Accelerated Alternated Inertial Relaxed Algorithm for Split Feasibilities with Applications in Breast Cancer Detection
DOI:
https://doi.org/10.58715/bangmodjmcs.2025.11.6Keywords:
Relaxed \(\mathcal{CQ}\) method, Alternated inertial method, Hybrid three-term conjugate gradient method, Split feasibility problem, Classification problemAbstract
In this article, we construct an accelerated relaxed algorithm with an alternating inertial extrapolation step. The proposed algorithm uses a three-term conjugate gradient-like direction, which helps to fasten the sequence of its iterates to a point in a solution set. The algorithm employs a self-adaptive step-length criterion that does not require any information related to the norm of the operator or the use of a line-search procedure. Moreover, we formulate and prove a strong convergence theorem for the algorithm to a minimum-norm solution of a split feasibility problem in infinite-dimensional real Hilbert spaces. Furthermore, we investigate its applications in breast cancer detection by solving classification problems for an interesting real-world breast cancer dataset, based on the extreme learning machine (ELM) with the \(\ell_{1}\)-regularization approach (i.e., the Lasso model) and the \(\ell_{1}\)-\(\ell_{2}\) hybrid regularization technique. The performance results of the experiments demonstrate that the proposed algorithm is robust, efficient, and achieves better generalization performance and stability than some existing algorithms in the literature.
Downloads
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Bangmod International Journal of Mathematical and Computational Science

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.