AN ITERATIVE ALGORITHM FOR FINDING THE MINIMUM NORM POINT IN THE SOLUTION SET OF SPLIT FIXED POINT PROBLEM | Nghĩa | TNU Journal of Science and Technology

AN ITERATIVE ALGORITHM FOR FINDING THE MINIMUM NORM POINT IN THE SOLUTION SET OF SPLIT FIXED POINT PROBLEM

About this article

Received: 23/02/21                Revised: 18/05/21                Published: 26/05/21

Authors

1. Nguyen Trung Nghia, School of Applied Mathematics and Informatics, Hanoi University of Science and Technology
2. Nguyen Tat Thang Email to author, Thai Nguyen University

Abstract


The split feasibility problem and the variational inequality problem have many practical applications in signal processing, image reconstruction intensity-modulated radiation therapy, optimal control theory and many other fields. The problem we consider here is a bilevel problem, when the leader problem is the minimum norm point problem and the follower one is the split fixed point problem. The minimum norm point problem is a particular case of the variational inequality problem, when the cost mapping is the unit operator of the Hilbert space. In this paper, we propose an iterative method for approximating the solution of the bilevel problem. This method bases on the result presented by Tran Viet Anh and Le Dung Muu in 2016, which is a combination between the p ro jection method for variational inequality and the Krasnoselskii–Mann scheme for fixed points of nonexpansive mappings. The strong convergence of the method is proven. We close the paper by considering an example to illustrate the strong convergence of method.




Keywords


Split feasibility problem; Variational inequality; Hillbert spaces; Nonexpansive mapping; Fixed point

Full Text:

PDF

References


[1] Y. Censor, T. Elfving, ”A multiprojection algorithm using Bregman projections in a product space”, Numer. Algorithms, vol. 8, pp. 221–239, 1994.

[2] C. Byrne, ”Iterative oblique projection onto convex sets and the split feasibility problem”, Inverse Problems, vol. 18, no. 2, pp. 441–453, 2002.

[3] H.K. Xu, ”Iterative methods for the split feasibility problem in infinite dimensional Hilbert spaces”, Inverse Problems, 26:17p. Article ID 105018, 2010.

[4] J.L. Lions, G. Stampacchia, ”Variational inequalities”, Comm. Pure Appl. Math., vol. 20, pp. 493–519, 1967.

[5] G. Stampacchia, ”Formes bilineaires coercitives sur les ensembles convexes”,´ C. R. Acad. Sci. Paris, vol. 258, pp. 4413–4416, 1964.

[6] T.V. Anh, L.D. Muu, ”A projection-fixed point method for a class of bilevel variational inequalities with split fixed point constraints”, Optimization,vol. 65, no. 6, pp. 1229–1243, 2016.

[7] A. Moudafi, ”Krasnoselski–Mann iteration for hierarchical fixed-point problems”, Inverse Problems, vol. 23, pp. 1635–1640, 2007.

[8] R.P. Agarwal, D. O’Regan, D.R. Sahu (2009), Fixed Point Theory for Lipschitzian-type Mappings with Applications, Springer.

[9] I.V. Konnov, E. Laitinen, ”Theory and applications of variational inequalities”, Department of Mathematical Sciences, Faculty of Science, University of Oulu, ISBN 951-42-6688-9, 2002.

[10] C.E. Chidume, ”Geometric properties of Banach spaces and nonlinear iterations”, Springer Verlag Series, Lecture Notes in Mathematics, ISBN 978-1-84882-189-7, 2009.

[11] T. Suzuki, ”Strong convergence of Krasnoselskii and Mann’s type sequence for one parameter nonexpansive semigroup without Bochner integrals”, J. Math. Anal. Appl., vol. 305, pp. 227–239, 2005.

[12] H.K. Xu, ”Iterative algorithms for nonlinear operators”, J. London Math. Soc., vol. 66, pp. 240–256, 2002.




DOI: https://doi.org/10.34238/tnu-jst.4024

Refbacks

  • There are currently no refbacks.
TNU Journal of Science and Technology
Rooms 408, 409 - Administration Building - Thai Nguyen University
Tan Thinh Ward - Thai Nguyen City
Phone: (+84) 208 3840 288 - E-mail: jst@tnu.edu.vn
Based on Open Journal Systems
©2018 All Rights Reserved