Papers
Topics
Authors
Recent
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

Published 20 Jan 2014 in math.OC | (1401.4865v2)

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

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.