Averaging Schemes for Solving Fived Point and Variational Inequality Problems

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5325

Title:	Averaging Schemes for Solving Fived Point and Variational Inequality Problems
Issue Date:	9-Oct-2013
Publisher:	Massachusetts Institute of Technology, Operations Research Center
Description:	We develop and study averaging schemes for solving fixed point and variational inequality problems. Typically, researchers have established convergence results for solution methods for these problems by establishing contractive estimates for their algorithmic maps. In this paper, we establish global convergence results using nonexpansive estimates. After first establishing convergence for a general iterative scheme for computing fixed points, we consider applications to projection and relaxation algorithms for solving variational inequality problems and to a generalized steepest descent method for solving systems of equations. As part of our development, we also establish a new interpretation of a norm condition typically used for establishing convergence of linearization schemes, by associating it with a strong-f-monotonicity condition. We conclude by applying our results to transportation networks.
URI:	http://koha.mediu.edu.my:8181/xmlui/handle/1721
Other Identifiers:	http://hdl.handle.net/1721.1/5325
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI