A proximal point algorithm with generalized proximal distances to BEPs
classification
🧮 math.OC
keywords
proximalproblemalgorithmconsiderdistancesequilibriumgeneralizedpoint
read the original abstract
We consider a bilevel problem involving two monotone equilibrium bifunctions and we show that this problem can be solved by a proximal point method with generalized proximal distances. We propose a framework for the convergence analysis of the sequences generated by the algorithm. This class of problems is very interesting because it covers mathematical programs and optimization problems under equilibrium constraints. As an application, we consider the problem of the stability and change dynamics of task's allocation in a hierarchical organization.
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.