Hybrid steepest descent method for variational inequality problem over the fixed point set of certain quasi-nonexpansive mappings

Numerical Functional Analysis and Optimization

Volumn 25, Issue 7-8, 2004, Pages 619-655

  Yamada, Isao ^a   Ogura, Nobuhiko ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INVERSE PROBLEMS; NONLINEAR SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

FIXED POINT; HYBRID STEEPEST DESCENT METHOD; QUASI-NONEXPANSIVE MAPPING; VARIATIONAL INEQUALITY PROBLEMS;

MAPPING;

EID: 11144241645     PISSN: 01630563     EISSN: None     Source Type: Journal    
DOI: 10.1081/NFA-200045815     Document Type: Article

References (69)

1. Baillon, J.-B., Haddad, G. (1977). Quelques propriétés des opérateurs angle-bornés et n-cycliquement monotones. Israel J. Math. 26:137-150.
2. Baillon, J.-B., Bruck, R. E., Reich, S. (1978). On the asymptotic behavior of nonexpansive mappings and semigroups in Banach spaces. Houston J. Math. 4:1-9.
3. Barbu, V., Precupanu, Th. (1986). Convexity and Optimization in Banach Spaces. 3rd ed. D. Reidel Publishing Company.
4. Bauschke, H. H. (1996). The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space. J. Math. Anal. Appl. 202:150-159.
5. Bauschke, H. H., Borwein, J. M. (1996). On projection algorithms for solving convex feasibility problems. SIAM Review 38:367-426.
6. Bauschke, H. H., Combettes, P. L. (2001). A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert space. Math. Oper. Res. 26:248-264.
7. Bauschke, H. H., Borwein, J. M., Lewis, A. S. (1997). The method of cyclic projections for closed convex sets in Hilbert space. Contemp. Math. 204:1-38.
8. Bertero, M., Boccacci, P. (1998). Introduction to Inverse Problems in Imaging. IOP.
9. Borwein, J. M., Fitzpatrick S., Vanderwerff, J. (1994). Examples of convex functions and classifications of normed spaces. J. Convex Anal. 1:61-73.
10. Bruck, R. E., Reich, S. (1977). Nonexpansive projections and resolvents of accretive operators in Banach spaces. Houston J. Math. 3:459-470.
11. Byrne, C. L. (2004). A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Problems 20:103-120.
12. Censor, Y., Iusem, A. N., Zenios, S. A. (1998). An interior point method with Bregman functions for the variational inequality problem with paramonotone operators. Math. Programming 81:373-400.
13. Combettes, P. L. (1995). Construction d'un point fixe commun à une famille de contractions fermes. C.R. Acad. Sci.Paris Sèr. I Math. 320:1385-1390.
14. Combettes, P. L. (1997). Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections. IEEE Trans. Image Process. 6(4):493-506.
15. Combettes, P. L. (2003). A block-iterative surrogate constraint splitting method for quadratic signal recovery. IEEE Trans. Signal Process. 51(7):1771-1782.
16. Combettes, P. L., Pesquet, J-C. (2004). Image restoration subject to a total variation constraint. IEEE Trans. Image Process. 13(9):1213-1222.
17. Deutsch, F., Yamada, I. (1998). Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings. Numer, Funct. Anal. Optim. 19:33-56.
18. Dolidze, Z. O. (1982). Solutions of variational inequalities associated with a class of monotone maps. Ekonomika i Matem. Melody 18:925-927.
19. Dunford, N., Schwartz, J. T. (1988). Linear Operators Part I: General Theory. Wiley Classics Library Ed. John Wiley & Sons.
20. Dunn, J. C. (1976). Convexity, monotonicity, and gradient processes. J. Math. Anal. Appl. 53:145-158.
21. Eicke, B. (1992). Iteration methods for convexly constrained ill-posed problems in Hubert space. Numer. Funct. Anal. Optim. 13:413-429.
22. Ekeland, I., Themam, R. (1999). Convex Analysis and Variational Problems. Classics in Applied Mathematics 28. SIAM.
23. Goebel, K., Reich, S. (1984). Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings. New York and Basel: Dekker.
24. Goebel, K., Kirk, W. A. (1990). Topics in Metric Fixed Point Theory. Cambridge University Press.
25. Goldstein, A. A. (1964). Convex programming in Hubert space. Bull. Am. Math. Soc. 70:709-710.
26. Golshtein, E. G., Tretyakov, N. V. (1996). Modified Lagrangians & Monotone Maps in Optimization. Wiley and Sons.
27. Groetsch, C. W. (1993). Inverse Problems in Mathematical Sciences. Braunschweig: Vieweg.
28. Halpern, B. (1967). Fixed points of nonexpanding maps. Bull. Am. Math. Soc. 73:957-961.
29. Haugazeau, Y. (1968). Sur les Inéquations Variationnelles et la Minimisation de Fonctionnelles Convexes. Thèse, Universite de Paris.
30. Hiriart, J.-B., Lemaréchal, C. (1993). Convex Analysis and Minimization Algorithms. Springer.
31. Kiwiel, K. C. (1995). Block-iterative surrogate projection methods for convex feasibility problems. Linear Algebra Appl. 215:225-259.
32. Levitin, E. S., Polyak, B. T. (1966). Constrained minimization method. USSR Comput. Math. Math. Phys. 6:1-50.
33. Lions, P. L. (1977). Approximation de points fixes de contractions. C. R. Acad. Sci. Paris Sèrie A-B 284:1357-1359.
34. Liu, F., Nashed, M. Z. (1998). Regularization of nonlinear ill-posed variational inequalities and convergence rates. Set-Valued Anal. 6:313-344.
35. Luenberger, D. G. (1968). Optimization by Vector Space Methods. Wiley.
36. Ogura, N., Yamada, I. (2002). Non-strictly convex minimization over the fixed point set of the asymptotically shrinking nonexpansive mapping. Numer. Fund. Anal. Optim. 23:113-137.
37. Ogura, N., Yamada, I. (2003). Non-strictly convex minimization over the bounded fixed point set of nonexpansive mapping. Numer. Fund. Anal. Optim. 24:129-135.
38. Ogura, N., Yamada, I. (2004a). Convex feasibility problem with prioritized hard constraints-Double layered projected gradient method. IEICE Trans. Fundamentals E87-A(4):872-878.
39. Ogura. N., Yamada. I. (2004b). A deepest outer approximating half space of the level set of certain quadratic function, submitted for publication.
40. Opial, Z. (1967). Weak convergence of the sequence of successive approximations for nonexpansive mapping. Bull. Am. Math. Soc. 73:591-597.
41. Reich, S. (1983). Some problems and results in fixed point theory. Contemp. Math. 21:179-187.
42. Sabharwal, A., Potter, L. C. (1998). Convexly constrained linear inverse problems: Iterative least-squares and regularization. IEEE Trans. Signal Process. 46:2345-2352.
43. Slavakis, K., Yamada, I., Sakaniwa, K. (2003). Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method. Signal Process. 83:1135-1140.
44. Stark, H., Yang, Y. (1998). Vector Space Projections - A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics. John Wiley & Sons.
45. Takahashi, W. (2000). Nonlinear Functional Analysis-Fixed Point Theory and its Applications. Yokohama Publishers.
46. Vasin, V. V. (1992). Ill-posed problems and iterative approximation of fixed points of pseudo-contractive mappings. In: Tikhonov, A., ed. Ill-posed Problems in Natural Sciences. VSP, pp. 214-223.
47. Vasin, V. V. (2004). A comments on Theorem 2.9 (Chapter 2) in Vasin and Ageev (1995). Personal Communication, Feb. 2004.
48. Vasin, V. V., Ageev A. L. (1995). Ill-Posed Problems with a Priori Information. VSP.
49. Wittmann, R. (1992). Approximation of fixed points of nonexpansive mappings. Arch. Math. 58:486-491.
50. Xu, H. K., Kim, T. H. (2003). Convergence of hybrid steepest descent methods for variational inequalities. J. Optimization Theory Appl. 119(1):185-201.
51. Yamada, I. (1999). Approximation of convexly constrained pseudoinverse by hybrid steepest descent method. In: Proceedings of the IEEE ISCAS'99. Florida, May.
52. Yamada, I. (2000). Convex projection algorithm from POCS to hybrid steepest descent method. J. IEICE 83(8):616-623. in Japanese.
53. Yamada, I. (2001). The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings. In: Butnariu, D., Censor, Y., Reich, S., eds. Inherently Parallel Algorithm for Feasibility and Optimization and Their Applications. Elsevier, pp. 473-504.
54. Yamada, I. (2003). Adaptive projected subgradient method: A unified view for projection based adaptive algorithms. J. IEICE 86(8):654-658. In Japanese.
55. Yamada, I., Ogura, N. (2003a). Adaptive projected subgradient method and its applications to signal procesing problems. In: The Third International Conference on Nonlinear Analysis and Convex Analysis. Tokyo, August.
56. Yamada, I., Ogura, N. (2003b). Adaptive projected subgradient method and its applications to set theoretic adaptive filtering. In: Proceedings of the Thirty-Seventh Asilomar Conference on Signals, Systems and Computers. California, Nov.
57. Yamada, I., Ogura, N. (2004a). Two Generalizations of the Projected Gradient Method for Convexly Constrained Inverse Problems-Hybrid Steepest Descent Method, Adaptive Projected Subgradient Method, Numerical Analysis and New Information Technology'03 (NANIT'03). Kyoto University: Research Institute of Mathematical Sciences, December 2003 (Published in "Kokyuroku" 1362, pp. 88-94, April, 2004).
58. Yamada, I., Ogura, N. (2004b). Hybrid steepest descent method for the variational inequality problem over the fixed point sets of certain quasi-nonexpansive mappings. In: Victoria International Conference 2004, Wellington, February.
59. Yamada, I., Ogura, N. (2004c). Adaptive projected subgradient method for asymptotic minimization of sequence of nonnegative convex functions. Numer. Funct. Anal. Optim. 25(7-8):593-617.
60. Yamada, I., Ogura, N., Yamashita, Y., Sakaniwa, K. (1996). An extension of optimal fixed point theorem for nonexpansive operator and its application to set theoretic signal estimation. Tech. Rep. IEICE DSP96-106:63-70.
61. Yamada, I., Ogura, N., Yamashita, Y., Sakaniwa, K. (1998). Quadratic optimization of fixed points of nonexpansive mappings in Hubert space. Numer. Funct. Anal. Optim. 19:165-190.
62. Yamada, I., Slavakis, K., Yamada, K. (2002a). An efficient robust adaptive filtering algorithm based on parallel subgradient projection techniques. IEEE Trans. Signal Process. 50(5):1091-1101.
63. Yamada, I., Ogura, N., Shirakawa, N. (2002b). A numerically robust hybrid steepest descent method for the convexly constrained generalized inverse problems. In: Nashed, Z., Scherzer, O., eds. Inverse Problems, Image Analysis, and Medical Imaging. Contemporary Mathematics. 313:269-305.
64. Yosida, K. (1974). Functional Analysis. 4th ed. Springer.
65. Youla, D. C. (1978). Generalized image restoration by the method of alternating orthogonal projections. IEEE Trans. Circuits Syst. 25:694-702.
66. Youla, D. C., Webb, H. (1982). Image restoration by the method of convex projections: Part 1- Theory. IEEE Trans. Med. Imaging 1:81-94.
67. Zarantonello, E. H. ed. (1971). Contributions to Nonlinear Functional Analysis. Academic Press.
68. Zeidler, E. (1985). Nonlinear Functional Analysis and its Applications, III-Variational Methods and Optimization. Springer.
69. Zeidler, E. (1990). Nonlinear Functional Analysis and its Applications, II/B-Nonlinear Monotone Operators. Springer.