Equilibrium programming using proximal-like algorithms
Flå, Sjur Didrik
Antipin, Anatoly S.

Data: 1997
Resum: We compute constrained equilibria satisfying an optimality condition. Important examples include convex programming, saddle problems, noncooperative games, and variational inequalities. Under a monotonicity hypothesis we show that equilibrium solutions can be found via iterative convex minimization. In the main algorithm each stage of computation requires two proximal steps, possibly using Bregman functions. One step serves to predict the next point; the other helps to correct the new prediction. To enhance practical applicability we tolerate numerical errors. .
Llengua: Anglès.
Document: Article ; recerca ; article ; publishedVersion
Matèria: Equilibrium problems ; Convex programming ; Saddle problems ; Non-cooperative games ; Variational inequalities ; Quasi-monotonicity ; Proximal point algorithms ; Bregman distances
Publicat a: Mathematical Programming, vol. 78 n. 1 (1997) p. 29-41, ISSN 0025-5610

13 p, 621.7 KB
 Accés restringit a la UAB

El registre apareix a les col·leccions:
Articles > Articles de recerca
Articles > Articles publicats

 Registre creat el 2006-03-13, darrera modificació el 2017-10-28

   Favorit i Compartir