Answers are grounded in this paper and cite their sources.
A new accelerated common fixed point algorithm is introduced and analyzed for a countable family of nonexpansive mappings and then we apply it to solve some convex bilevel optimization problems. Then, under some suitable conditions, we prove a strong convergence result of the proposed algorithm. As an application, we employ the proposed algorithm for regression and classification problems. Moreover, we compare the performance of our algorithm with others. By numerical experiments, we found that our algorithm has a better performance than the others.
No takes yet. Share an insight, caveat, or question.
Thongsri et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: