@techreport{iiasa4538,
           month = {June},
            type = {IIASA Working Paper},
           title = {Equilibrium Programming Using Proximal-Like Algorithms},
         address = {IIASA, Laxenburg, Austria},
       publisher = {WP-95-055},
            year = {1995},
             url = {https://pure.iiasa.ac.at/id/eprint/4538/},
        abstract = {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.},
          author = {Flam, S. D.}
}