Answers are grounded in this paper and cite their sources.
This chapter reports weak and strong convergence findings in hierarchical equilibrium problems, suggesting further applications in convex minimization and variational inequalities.
In this chapter, we introduce the relaxed inertial proximal splitting algorithm (RIPSA) for hierarchical equilibrium problems. Using Opial-Passty's lemma, we first establish weak ergodic and weak convergence of the sequence generated by the algorithm to a solution of the problem, in the absence of the Browder-Halpern contraction factor. We then derive a strong convergence result under an additional strong monotonicity assumption. Subsequently, we relax this requirement by removing strong monotonicity and instead incorporating a Browder-Halpern contraction factor into (RIPSA), which guarantees strong convergence to a solution determined by the contraction factor. Finally, we discuss two related settings: convex minimization problems and monotone variational inequalities formulated as fixed-point problems for nonexpansive operators.
No takes yet. Share an insight, caveat, or question.
Mazgouri et al. (2025) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: