Article ID: | iaor20112658 |
Volume: | 149 |
Issue: | 1 |
Start Page Number: | 61 |
End Page Number: | 78 |
Publication Date: | Apr 2011 |
Journal: | Journal of Optimization Theory and Applications |
Authors: | Marino Giuseppe, Xu Hong-Kun |
Keywords: | programming: convex |
An explicit hierarchical fixed point algorithm is introduced to solve monotone variational inequalities, which are governed by a pair of nonexpansive mappings, one of which is used to define the governing operator and the other to define the feasible set. These kinds of variational inequalities include monotone inclusions and convex optimization problems to be solved over the fixed point sets of nonexpansive mappings. Strong convergence of the algorithm is proved under different circumstances of parameter selections. Applications in hierarchical minimization problems are also included.