Answers are grounded in this paper and cite their sources.
Study introduces a novel algorithm to solve mixed equilibrium problems in Hadamard spaces, suggesting improved convergence rates.
This work introduces a novel modified Halpern-type proximal point algorithm, designed for a finite family of k -demimetric mappings, resolvents of monotone operators, and resolvents of mixed equilibrium problems. In the context of Hadamard spaces, we establish the convergence of the perturbed algorithm to a common zero of the finite family of mixed equilibrium problems and monotone operators, as well as to a common fixed point of the finite family of k -demimetric mappings. Furthermore, we provide a numerical example to illustrate the effectiveness of the proposed algorithm.
No takes yet. Share an insight, caveat, or question.
Abbas et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: