Equilibrium programming using proximal-like algorithms

Equilibrium programming using proximal-like algorithms

0.00 Avg rating0 Votes
Article ID: iaor1999951
Country: Netherlands
Volume: 78
Issue: 1
Start Page Number: 29
End Page Number: 41
Publication Date: Jul 1997
Journal: Mathematical Programming
Authors: ,
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.