Abstract
In this paper, we consider the generalized variational inequality GVI(F, g,C), where F and g are mappings from a Hilbert space into itself and C is the fixed point set of a nonexpansive mapping. We propose two iterative algorithms to find approximate solutions of the GVI(F, g,C). Strong convergence results are established and applications to constrained generalized pseudo–inverse are included.
Similar content being viewed by others
References
Pang, J. S., Yao, J. C.: On a generalization of a normal map and equations. SIAM J. Control Optim., 33, 168–184 (1995)
Kinderlehrer, D., Stampacchia, G.: An Introduction to Variational Inequalities and Their Applications, Academic Press, New York, 1980
Glowinski, R.: Numerical Methods for Nonlinear Variational Problems, Springer, New York, 1984
Jaillet, P., Lamberton, D., Lapeyre, B.: Variational inequalities and the pricing of American options. Acta Appl. Math., 21, 263–289 (1990)
Oden, J. T.: Qualitative Methods on Nonlinear Mechanics, Prentice–Hall, Englewood Cliffs, New Jersey, 1986
Yao, J. C.: Variational inequalities with generalized monotone operators. Math. Oper. Res., 49, 691–705 (1994)
Konnov, I.: Combined Relaxation Methods for Variational Inequalities, Springer, Berlin, 200
Zeng, L. C.: Completely generalized strongly nonlinear quasi-complementarity problems in Hilbert spaces. J. Math. Anal. Appl., 193, 706–714 (1995)
Zeng, L. C.: Iterative algorithm for .nding approximate solutions to completely generalized strongly nonlinear quasivariational inequalities. J. Math. Anal. Appl., 201, 180–194 (1996)
Zeng, L. C.: On a general projection algorithm for variational inequalities. J. Optim. Theory Appl., 97, 229–235 (1998)
Yamada, I.: The hybrid steepest-descent method for variational inequality problems over the intersection of the .xed point sets of nonexpansive mappings, Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications (edited by D. Butnariu, Y. Censor, and S. Reich), North-Holland, Amsterdam, Holland, 473–504, 2001
Deutsch, F., Yamada, I.: Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings. Numer. Funct. Anal. Optim., 19, 33–56 (1998)
Lions, P. L.: Approximation de points fixes de contractions. C. R. Hebd. Seanc. Acad. Sci. Paris, 284, 1357–1359 (1977)
Bauschke, H. H.: The approximation of fixed points of compositions of nonexpansive mappings in Hilbert spaces. J. Math. Anal. Appl., 202, 150–159 (1996)
Wittmann, R.: Approximation of .xed points of nonexpansive mappings. Arch. Math., 58, 486–491 (1992)
Xu, H. K., KIM, T. H.: Convergence of hybrid steepest-descent methods for variational inequalities. J. Optim. Theory Appl., 119, 185–201 (2003)
Xu, H. K.: An iterative approach to quadratic optimization. J. Optim. Theory Appl., 116, 659–678 (2003)
Xu, H. K.: Iterative algorithms for nonlinear operators. J. London Math. Soc., 66(2), 240–256 (2002)
Goebel, K., Kirk, W. A.: Topics on Metric Fixed–Point Theory. Cambridge University Press, Cambridge, 1990
Bauschke, H. H., Borwein, J. M.: On projection algorithms for solving convex feasibility problems. SIAM Review, 38, 367–426 (1996)
Engl, H. W., Hanke, M., Neubauer, A.: Regularization of Inverse Problems, Kluwer, Dordrecht, Holland, 2000
Author information
Authors and Affiliations
Corresponding author
Additional information
This project is partially supported both by the Teaching and Research Award Fund for Outstanding Young Teachers in Higher Education Institutions of MOE, P. R. C., and by the Dawn Program Foundation in Shanghai. Also, this project is partially supported by a grant from the National Science Council of Taiwan, partially supported by Shanghai Leading Academic Discipline Project, Project Number: T0401
Rights and permissions
About this article
Cite this article
Zeng, L.C., Wong, N.C. & Yao, J.C. Convergence of Hybrid Steepest–Descent Methods for Generalized Variational Inequalities. Acta Math Sinica 22, 1–12 (2006). https://doi.org/10.1007/s10114-005-0608-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10114-005-0608-3
Keywords
- iterative algorithms
- hybrid steepest–descent methods
- nonexpansive mappings
- Hilbert space
- Constrained generalized pseudo–inverse