Proximal algorithms with Bregman distances for bilevel equilibrium problems with application to the problem of "how routines form and change" in Economics and Management Sciences

2014/01/20 by G. C. Bento, Bento, G. C., J. X. Cruz Neto +5 · 1 citation
Computer Science · Economics, Econometrics and Finance · Mathematics · #47J25 #65K05 #90C33 #91E10 #Economic theories and models #FOS: Mathematics #Nonlinear Differential Equations Analysis #Optimization and Control (math.OC) #Optimization and Variational Analysis

paper · pdf · doi:10.48550/arxiv.1401.4865

openalex publication_date 2014/01/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we present the bilevel equilibrium problem under conditions of pseudomonotonicity. Using Bregman distances on Hadamard manifolds we propose a framework for to analyse the convergence of a proximal point algorithm to solve this bilevel equilibrium problem. As an application, we consider the problem of "how routines form and change" which is crucial for the dynamics of organizations in Economics and Management Sciences.

Cited by

• A proximal point algorithm with generalized proximal distances to BEPs

Related

• A proximal point algorithm with generalized proximal distances to BEPs
• Bilevel Optimization as a Regularization Approach to Pseudomonotone Equilibrium Problems
• Weak and strong convergence of an inertial proximal method for solving\n bilevel monotone equilibrium problems
• Equilibrium Problems and Proximal Algorithms in Hadamard Spaces
• A strong convergence theorem for solving an equilibrium problem and a fixed point problem using the Bregman distance