Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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 (1401.4865v2)

Published 20 Jan 2014 in math.OC

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.

Summary

We haven't generated a summary for this paper yet.