TY  - RPRT
CY  - IIASA, Laxenburg, Austria
ID  - iiasa4538
UR  - https://pure.iiasa.ac.at/id/eprint/4538/
A1  - Flam, S.D.
Y1  - 1995/06//
N2  - We consider problems where solutions -- called equilibria -- emerge as fixed points of an extremal mapping. Examples include convex programming, convex -- concave saddle problems, many noncooperative games, and quasi -- monotone variational inequalities. Using Bregman functions we develop proximal -- like algorithms for finding equilibria. At each iteration we allow numerical errors or approximate solutions.
PB  - WP-95-055
M1  - working_paper
TI  - Equilibrium Programming Using Proximal-Like Algorithms
AV  - public
EP  - 13
ER  -