%0 Report
%9 IIASA Working Paper
%A Flam, S.D.
%C IIASA, Laxenburg, Austria
%D 1995
%F iiasa:4538
%T Equilibrium Programming Using Proximal-Like Algorithms
%U https://pure.iiasa.ac.at/id/eprint/4538/
%X 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.