Extension of the hybrid steepest descent method to a class of variational inequalities and fixed point problems with nonself-mappings

Numerical Functional Analysis and Optimization

Volumn 29, Issue 7-8, 2008, Pages 820-834

  Maingé, Paul Emile ^a,b  

^a UNIVERSITÉ DES ANTILLES ET DE LA GUYANE   (France)

^b GRIMAAG   (Martinique)

Author keywords

Bilevel optimization; Convex minimization; Fixed point method; Variational inequality; Viscosity method

Indexed keywords

BILEVEL OPTIMIZATION; CONVERGENCE RESULTS; CONVEX MINIMIZATION; FIXE D POINTS; FIXED POINT METHOD; FIXED-POINT METHODS; HYBRID STEEPEST DESCENT METHOD; STRONG CONVERGENCE; TO MANY; VARIATIONAL INEQUALITIES; VARIATIONAL INEQUALITY; VISCOSITY METHOD;

KETONES; MAPPING; VARIATIONAL TECHNIQUES;

CONVERGENCE OF NUMERICAL METHODS;

EID: 52149108926     PISSN: 01630563     EISSN: 15322467     Source Type: Journal    
DOI: 10.1080/01630560802279371     Document Type: Article

References (21)

1. F.E. Browder and W.V. Petryshyn (1967). Construction of fixed points of nonlinear mappings in Hilbert spaces. J. Math. Anal. Appl. 20:197-228.
2. H.H. Bauschke and P.L. Combettes (2001). A weak-to-strong convergence principle for Fejér monotone methods in Hilbert space. Math. Oper. Res. 26:248-264.
3. P.L. Combettes (1997). Convex set theoretic image recovery by extrapolated iterations of paralell subgradients projections. IEEE Trans. on Image Processing 6:493-506.
4. P.L. Combettes and J.C Pesquet (2004). Image restoration subject to a. total variation constraint. IEEE Trans. on Image Processing 13:1213-1222.
5. F. Deutsch and I. Yamada (1998). Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings. Numer. Funct. Anal. Optim. 19:33-55.
6. I. Ekeland and R. Themam (1999). Convex Analysis and Variational Problems. Classic in Applied Mathematics. Vol. 28. SIAM, Philadelphia.
7. K. Goebel and W.A. Kirk (1990). Topics in Metric Fixed Point Theory. Cambridge Studies in Advanced Mathematics. Vol. 28. Cambridge University Press, Cambridge.
8. T.L. Hicks and J.D. Kubicek (1977). On the Mann iteration process in Hilbert spaces. J. Math. Anal. Appl. 59:498-504.
9. H. Iiduka and W. Takahashi (2004). Strong convergence theorems for nonexpansive nonself-mappings and inverse strongly monotone mappings. J. Convex Analysis 11:69-79.
10. S. Itoh and W. Takahashi (1978). The common fixed point theory of singlevalued mappings and multivalued mappings. Pacific J. Math. 79:493-508.
11. P.E. Maingé (2008). Convex minimization over the fixed points set of demicontractive mappings. Positivity 12:269-280.
12. P.E. Maingé and A. Moudafi (2007). Strong convergence of an iterative method for hierarchical fixed-point problems. Pacific J. Optimization 3:529-538.
13. G. Marino and H.K. Xu (2006). A general iterative method for nonexpansive mappings in Hilbert spaces. J. Math. Anal. Appl. 318:43-52.
14. G. Marino and H.K. Xu (2007). Weak and strong convergence theorems for strict pseudocontractions. J. Math. Anal. Appl. 329:336-346.
15. S. Maruster (1997). The solution by iteration of nonlinear equations in Hilbert spaces. Proc. Amer. Math. Soc. 63:69-73.
16. C. Moore (1998). Iterative aproximation of fixed points of demicontractive maps. The Abdus Salam. Intern. Centre for Theoretical Physics, Trieste, Italy, Scientific Report, IC/98/214, November.
17. N. Ogura and I. Yamada (2003). Non-strictly convex minimization over the bounded fixed point set of nonexpansive mappings. Numer. Funct. Anal. Optim. 24:129-135.
18. W. Takahashi (2000). Nonlinear Functional Analysis. Yokohama Publishers, Yokohama, Japan.
19. I. Yamada (2001). The hybrid steepest descent method for the variational inequality over the intersection of fixed point sets of nonexpansive mappings. In: Inherently Parallel Algorithm for Feasibility and Optimization and Their Applications. (D. Butnariu, Y. Censor, and S. Reich, eds.) Elsevier, Amsterdam, pp. 473-504.
20. I. Yamada and N. Ogura (2004). Hybrid steepest descent method for the variational inequality problem over the fixed point set of certain quasi-nonexpansive mappings. Numer. Funct. Anal. Optim. 25:619-655.
21. I. Yamada, N. Ogura, and N. Shirakawa (2002). A numerically robust hybrid steepest descent method for the convexly constrained generalized inverse problems. In: Inverse Problems, Image Analysis and Medical Imaging. (Z. Nashed and O. Scherzer, eds.) Contemporary Mathematics. Vol. 313. pp. 269-305.