A new self-adaptive CQ algorithm with an application to the LASSO problem
In this paper, we introduce a new self-adaptive CQ algorithm for solving split feasibility problems in real Hilbert spaces. The algorithm is designed, such that the stepsizes are directly computed at each iteration. We also consider the corresponding relaxed CQ algorithm for the proposed method. Under certain mild conditions, we establish weak convergence of the proposed algorithm as well as strong convergence of its hybrid-type variant. Finally, numerical examples illustrating the efficiency of our algorithm in solving the LASSO problem are presented.
KeywordsSplit feasibility problem variational inequality fixed point problem monotone operator weak convergence strong convergence
Mathematics Subject ClassificationPrimary 47J25 Secondary 65K15
The authors would like to thank the editor and the reviewers for their constructive suggestions and comments, which greatly improve the manuscript.
The second named author is funded by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under Grant No.101.01-2017.08. His research is also partially supported by the Vietnam Institute for Advanced Study in Mathematics and by UTC under Grant T2018-CB-002.
- 1.Alber, Ya.I., Iusem, A.N., Solodov, M.V.: On the projected subgradient method for nonsmooth convex optimization in a Hilbert space. Math. Program. 81, 23–35 (1998)Google Scholar
- 2.Ansari, Q.H., Rehan, A.: Split feasibility and fixed point problems. In: Ansari, Q.H. (ed.) Nonlinear Analysis: Approximation Theory, Optimization and Applications, pp. 281–322, Springer, New York (2014)Google Scholar