Convergence results for stochastic convex feasibility problem using random Mann and simultaneous projection iterative algorithms in Hilbert space

References

• Almudevar, A. 2014. Approximate iterative algorithm. Boca Raton: CRC Press.
   Google Scholar
• Berinde, V. 2007. Iterative approximations of fixed points. Berlin Heidelberg, New York: Springer-Verlag.
   Google Scholar
• Butnariu, D., Y. Censor, P. Gurfil, and E. Hadar. 2008. On the behavior of subgradient projections methods for convex feasibility problems in Euclidean spaces. SIAM Journal on Optimization 19 (2):786–807. doi: 10.1137/070689127.
   PubMed Web of Science ®Google Scholar
• Cegielski, A. 2010. Generalized relaxations of non-expansive operators and convex feasibility problems. Contemporary Mathematics 513, 111–23.
   Google Scholar
• Cegielski, A. 2012. Iterative methods for fixed point problems in Hilbert spaces. Berlin Heidelberg: Springer-Verlag. doi: 10.1007/978-3-642-30901-4.
   Google Scholar
• Chang, S., J. K. Kim, and X. R. Wang. 2010. Modified block iterative algorithm for solving convex feasibility problems in Banach Space. Journal of Inequalities and Applications 2010:1–14. doi: .
   Google Scholar
• Chen, X., R. J.-B. Wets, and Y. Zhang. 2012. Stochastic variational inequalities: Residual minimization smoothing/sample average approximations. SIAM Journal on Optimization 22 (2):649–73. doi: 10.1137/110825248.
   Web of Science ®Google Scholar
• Choi, H., and R. G. Baraniuk. 2004. Multiple wavelet basis image denoising using Besov ball projections. IEEE Signal Processing Letters 11 (9):717–20. doi: 10.1109/LSP.2004.833493.
   Web of Science ®Google Scholar
• Dudek, R. 2007. Iterative method for solving the linear feasibility problem. Journal of Optimization Theory and Applications 132 (3):401–10. doi: 10.1007/s10957-007-9163-7.
   Web of Science ®Google Scholar
• Grigoriadis, K. M., and R. E. Skelton. 1996. Alternating convex projection methods for discrete-time covariance control design. Journal of Optimization Theory and Applications 88 (2):399–432. doi: 10.1007/BF02192178.
   Web of Science ®Google Scholar
• Grigoriadis, K. M., A. E. Frazho, and R. E. Skelton. 1994. Application of alternating convex projection methods for computation of positive Toeplitz matrices. IEEE Transactions on Signal Processing 42 (7):1873–75. doi: 10.1109/78.298303.
   Web of Science ®Google Scholar
• Johansson, B., T. Elfving, V. Kozlov, Y. Censor, P.-E. Forss´En, and G. Granlund. 2006. The application of an oblique-projected Landweber method to a model of supervised learning. Mathematical and Computer Modelling 43 (7-8):892–909. doi: 10.1016/j.mcm.2005.12.010.
   Google Scholar
• Li, C., X. Duan, L. Lu, Q. Wang, and S. Shen. 2019. Iterative algorithm for solving a class of convex feasibility problem. Journal of Computational and Applied Mathematics 352:352–24. doi: 10.1016/j.cam.2018.11.029.
   Web of Science ®Google Scholar
• Maruster, S., and C. Popırla. 2008. On the Mann-type iteration and the convex feasibility problem. Journal of Computational Application and Mathematics 212:390–96.
   Web of Science ®Google Scholar
• O’Hara, J. G., P. Pillay, and H.-K. Xu. 2006. Iterative approaches to convex feasibility problems in Banach spaces. Nonlinear Analysis 64 (9):2022–42. doi: 10.1016/j.na.2005.07.036.
   Web of Science ®Google Scholar
• Okeke, G. A., and M. Abbas. 2015. Convergence and almost sure T-stability for a random iterative sequence generated by a generalized random operator. Journal of Inequalities and Applications 2015 (1):146–56. doi: 10.1186/s13660-015-0666-8.
   Google Scholar
• Okeke, G. A., and J. K. Kim. 2015. Convergence and summable almost T-stability of the random Picard-Mann hybrid iterative process. Journal of Inequalities and Applications 2015 (1):290–304. doi: 10.1186/s13660-015-0815-0.
   Google Scholar
• Okeke, G. A., and J. K. Kim. 2016. Convergence and (S,T)-stability almost surely for random Jungck-type iteration processes with applications. Cogent Mathematics 3 (1):1258768–15. doi: 10.1080/23311835.2016.1258768.
   Web of Science ®Google Scholar
• Robbins, H., and S. Monro. 1951. A stochastic optimization method. The Annals of Mathematical Statistics 22 (3):400–407. doi: 10.1214/aoms/1177729586.
   Google Scholar
• Sharma, J. K. 2013. Operations research: Theory and applications. 5th ed. Delhi, India: Macmillan Publishers.
   Google Scholar
• Taha, H. E. 1997. Operations research-an introduction. New Jersey; London: Prentice-Hall Inc.
   Google Scholar
• Udom, A. U. 2018. Stochastic approximation result for variational inequality problem using random- type iterative schemes. Communications in Statistics - Theory and Methods 47 (22):5435– 44. doi: 10.1080/03610926.2017.1395046.
   Web of Science ®Google Scholar
• Udom, A. U., and E. O. Ossai. 2019. Stochastic approximation results for random variational inequality problem with monotone operator in Hilbert space and its application to optimal control. Journal of Statistics and Management Systems 22 (8):1539–54. doi: 10.1080/09720510.2019.1637160.
   Web of Science ®Google Scholar
• Udom, A. U., and T. E. Ugah. 2020. Strong convergence result for solution of stochastic convex minimization problem generated by generalized random iterative scheme. Journal of Information and Optimization Sciences 41 (5):1207–21. doi: 10.1080/02522667.2019.1641269.
   Google Scholar
• Zhang, S.-S., X.-R. Wang, M. Liu, and J-h Zhu. 2011. Almost sure T-stability and convergence for iterative algorithms. Applied Mathematics and Mechanics 32 (6):805–10. doi: 10.1007/s10483-011-1460-6.
   Web of Science ®Google Scholar