Abstract
In the present paper, we explore a family of projection gradient methods for solving the multiple-sets split feasibility problem, which include the cyclic/simultaneous iteration methods introduced in Wen et al. (J Optim Theory Appl 166:844–860, 2015) as special cases. For the general case, where the involved sets are given by level sets of convex functions, the calculation of the projection onto the level sets is complicated in general, and thus, the resulting projection gradient method cannot be implemented easily. To avoid this difficulty, we introduce a family of relaxed projection gradient methods, in which the projections onto the approximated halfspaces are adopted in place of the ones onto the level sets. They cover the relaxed cyclic/simultaneous iteration methods introduced in Wen et al. (J Optim Theory Appl 166:844–860, 2015) as special cases. Global weak convergence theorems are established for these methods. In particular, as direct applications of the established theorems, our results fill some gaps and deal with the imperfections that appeared in Wen et al. (J Optim Theory Appl 166:844–860, 2015) and hence improve and extend the corresponding results therein.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Censor, Y., Elfving, T.: A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 8, 221–239 (1994)
Byrne, C.: A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 20, 103–120 (2004)
He, H., Ling, C., Xu, H.K.: An implementable splitting algorithm for the \(\ell _1\)-norm regularized split feasibility problem. J. Sci. Comput. 67, 1–18 (2015)
Censor, Y., Bortfeld, T., Martin, B., Trofimov, A.: A unified approach for inversion problems in intensity-modulated radiation therapy. Phys. Med. Biol. 51, 2353–2365 (2006)
Wang, J.H., Hu, Y.H., Li, C., Yao, J.C.: Linear convergence of CQ algorithms and applications in gene regulatory network inference. Inverse Probl. 33, 055017 (2017)
Hu, Y.H., Li, C., Meng, K.W., Qin, J., Yang, X.Q.: Group sparse optimization via \(\ell _{p, q}\) regularization. J. Mach. Learn. Res. 18, 1–52 (2017)
Byrne, C.: Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 18, 441–453 (2002)
Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367–426 (1996)
Bauschke, H.H., Kruk, S.G.: Reflection-projection method for convex feasibility problems with an obtuse cone. J. Optim. Theory Appl. 120, 503–531 (2004)
Hu, Y.H., Li, C., Yang, X.Q.: On convergence rates of linearized proximal algorithms for convex composite optimization with applications. SIAM J. Optim. 26, 1207–1235 (2016)
Li, G.Y., Pong, T.K.: Douglas–Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems. Math. Program. Ser. A 159, 371–401 (2016)
Censor, Y., Elfving, T., Kopf, N., Bortfeld, T.: The multiple-sets split feasibility problem and its applications for inverse problems. Inverse Probl. 21, 2071–2084 (2005)
Xu, H.K.: A variable Krasnosel’skiĭ-Mann algorithm and the multiple-set split feasibility problem. Inverse Probl. 22, 2021–2034 (2006)
Zhang, W.X., Han, D.R., Li, Z.B.: A self-adaptive projection method for solving the multiple-sets split feasibility problem. Inverse Probl. 25, 115001 (2009)
Zhao, J.L., Yang, Q.Z.: Self-adaptive projection methods for the multiple-sets split feasibility problem. Inverse Probl. 27, 035009 (2011)
Zhao, J.L., Yang, Q.Z.: A simple projection method for solving the multiple-sets split feasibility problem. Inverse Probl. Sci. Eng. 21, 537–546 (2013)
Wen, M., Peng, J.G., Tang, Y.C.: A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem. J. Optim. Theory Appl. 166, 844–860 (2015)
Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Space. Springer, London (2011)
Bregman, L.M.: The method of successive projection for finding a common point of convex sets. Sov. Math. Dokl. 6, 688–692 (1965)
Gubin, L.G., Polyak, B.T., Raik, E.V.: The method of projections for finding the common point of convex sets. USSR Comput. Math. Math. Phys. 7, 1–24 (1967)
Combettes, P.L.: Hilbertian convex feasibility problem: convergence of projection methods. Appl. Math. Optim. 35, 311–330 (1997)
Zhao, X., Ng, K.F., Li, C., Yao, J.C.: Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems. Appl. Math. Optim. 78, 613–641 (2018)
Acknowledgements
The authors are grateful to the anonymous referees and the editor for their valuable comments and suggestions that helped to improve the quality of this paper. Jinhua Wang was supported in part by the National Natural Science Foundation of China (Grant 11771397) and Zhejiang Provincial Natural Science Foundation of China (Grant LY17A010021). Yaohua Hu was supported in part by National Natural Science Foundation of China (11601343, 11601344, 11871347), Natural Science Foundation of Guangdong (2016A030310038), Natural Science Foundation of Shenzhen (JCYJ20170817100950436, JCYJ20170818091621856) and Interdisciplinary Innovation Team of Shenzhen University. Carisa Kwok Wai Yu is supported in part by the Research Grants Council of the Hong Kong Special Administrative Region, China (UGC/FDS14/P02/15 and UGC/FDS14/P02/17).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Julian P. Revalski.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Wang, J., Hu, Y., Yu, C.K.W. et al. A Family of Projection Gradient Methods for Solving the Multiple-Sets Split Feasibility Problem. J Optim Theory Appl 183, 520–534 (2019). https://doi.org/10.1007/s10957-019-01563-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-019-01563-2