Computing Fixed Points by Averaging
Averaging methods for solving fixed point problems combine the underlying fixed point map T with some “well-behaved” map g. The map g might, for example, be contractive or might be a nonexpansive map whose fixed points include those of the original map T. One class of averaging methods (inside averaging) averages any current iterate with its image under the map g, and then applies the map T. Another averaging method (outside averaging) first applies the maps T and g and then takes averages. When g is the identity map, outside averaging averages a given point with its image under the map T. In this paper we summarize a number of known results concerning these averaging methods, including (i) a general averaging framework that approximates the original fixed point problem with a trajectory of averaged (parametrized) fixed point subproblems, and (ii) a procedure for following these trajectories approximately to ease the computations.
KeywordsVariational Inequality Average Method Variational Inequality Problem Point Solution Function Iteration
Unable to display preview. Download preview PDF.
- Bauschke H.H. (1994). The approximation of fixed points of compositions of non-expansive mappings in Hilbert space. Preprint. Center for Experimental and Constructive Mathematics, Simon Fraser University, Burnaby, British Columbia, Canada V5A 1S6.Google Scholar
- Bottom J., Ben-Akiva M., Bierlaire M., Chabini I., Koutsopoulos H. and Yang Q. (1999). Investigation of route guidance generation issues by simulation with DynaMIT. Proceedings of 14th International Symposium on Transportation and Traffic Theory, Jerusalem.Google Scholar
- Epelman M., Magnanti T.L. and Perakis G. (1998). Finding fixed points by averaging with well-behaved maps. preprint.Google Scholar
- Magnanti T.L. and Perakis G. (1998a). Solving variational inequalities and fixed point problems by averaging and optimizing potentials. preprint.Google Scholar
- Magnanti T.L. and Perakis G. (1998b). From Frank-Wolfe to steepest descent; a descent framework for solving asymmetric variational inequalities. preprint.Google Scholar
- Robinson J. (1951). An iterative method of solving a game. Annals of Mathematics, 54, 2: 296–301.Google Scholar
- Wu J.H., Florian M., and Marcotte P. (1993)). A general descent framework for the monotone variational inequality problem. Mathematical Programming, 61: 281–300.Google Scholar