eprintid: 4538
rev_number: 20
eprint_status: archive
userid: 351
dir: disk0/00/00/45/38
datestamp: 2016-01-15 02:06:10
lastmod: 2021-08-27 17:15:18
status_changed: 2016-01-15 02:06:10
type: monograph
metadata_visibility: show
item_issues_count: 2
creators_name: Flam, S.D.
creators_id: 8081
title: Equilibrium Programming Using Proximal-Like Algorithms
ispublished: pub
internal_subjects: iis_ecn
internal_subjects: iis_frc
internal_subjects: iis_met
divisions: prog_opt
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.
date: 1995-06
date_type: published
publisher: WP-95-055
iiasapubid: WP-95-055
price: 10
creators_browse_id: 1255
full_text_status: public
monograph_type: working_paper
place_of_pub: IIASA, Laxenburg, Austria
pages: 13
coversheets_dirty: FALSE
fp7_type: info:eu-repo/semantics/book
citation:   Flam, S.D. <https://pure.iiasa.ac.at/view/iiasa/1255.html>  (1995).  Equilibrium Programming Using Proximal-Like Algorithms.   IIASA Working Paper. IIASA, Laxenburg, Austria: WP-95-055     
document_url: https://pure.iiasa.ac.at/id/eprint/4538/1/WP-95-055.pdf