Equilibrium Problems and Proximal Algorithms in Hadamard Spaces
classification
🧮 math.OC
math.FA
keywords
equilibriumhadamardproblemsspacesproximalregularizedadequatelyalgorithm
read the original abstract
In this paper, we consider the equilibrium problems and also their regularized problems under the setting of Hadamard spaces. The solution to the regularized problem is represented in terms of resolvent operators. As an essential machinery in the existence of an equilibrium, we first prove that the KKM principle is attained in general Hadamard spaces without assuming the compactness of the closed convex hull of a finite set. We construct the proximal algorithm based on this regularization and give convergence analysis adequately.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.