Advertisement

A new self-adaptive CQ algorithm with an application to the LASSO problem

  • Pham Ky Anh
  • Nguyen The Vinh
  • Vu Tien Dung
Article
  • 106 Downloads

Abstract

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.

Keywords

Split feasibility problem variational inequality fixed point problem monotone operator weak convergence strong convergence 

Mathematics Subject Classification

Primary 47J25 Secondary 65K15 

Notes

Acknowledgements

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.

References

  1. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 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
  3. 3.
    Aubin, J.P.: Optima and Equilibria: An Introduction to Nonlinear Analysis. Springer, News York (1993)CrossRefzbMATHGoogle Scholar
  4. 4.
    Byrne, C.: Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 18, 441–453 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Byrne, C.: A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 20, 103–120 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Ceng, L.C., Ansari, Q.H., Yao, J.C.: An extragradient method for solving split feasibility and fixed point problems. Comput. Math. Appl. 64, 633–642 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Censor, Y., Elfving, T.: A multiprojection algorithm using Bregman projection in a product space. Numer. Algorithms 8, 221–239 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    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 (2003)CrossRefGoogle Scholar
  9. 9.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Bello Cruz, J.Y., Iusem, A.N.: Convergence of direct methods for paramonotone variational inequalities. Comput. Optim. Appl. 46, 247–263 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Bello Cruz, J.Y., Iusem, A.N.: An explicit algorithm for monotone variational inequalities. Optimization 61, 855–871 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Dang, Y., Gao, Y.: The strong convergence of a KM-CQ-like algorithm for a split feasibility problem. Inverse Probl. 27, 015007 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Gibali, A.: Algorithm for solving the set-valued variational inequality problem in Euclidean space. Pac. J. Optim. 9, 61–75 (2013)MathSciNetzbMATHGoogle Scholar
  14. 14.
    Goebel, K., Reich, S.: Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings. Marcel Dekker, New York (1984)zbMATHGoogle Scholar
  15. 15.
    López, G., Martín-Márquez, V., Wang, F., Xu, H.K.: Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Probl. 28, 085004 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Masad, E., Reich, S.: A note on the multiple-set split convex feasibility problem in Hilbert space. J. Nonlinear Convex Anal. 8, 367–371 (2007)MathSciNetzbMATHGoogle Scholar
  17. 17.
    Qu, B., Xiu, N.: A note on the CQ algorithm for the split feasibility problem. Inverse Probl. 21, 1655–1665 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Solodov, M.V., Svaiter, B.F.: Forcing strong convergence of proximal point iterations in Hilbert space. Math. Progr. 87, 189–202 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Tan, K.K., Xu, H.K.: Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process. J. Math. Anal. Appl. 178, 301–308 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Tibshirani, R.: Regression shrinkage and selection via the LASSO. J. R. Stat. Soc. Ser. B 58, 267–288 (1996)MathSciNetzbMATHGoogle Scholar
  21. 21.
    Wang, F., Xu, H.K.: Cyclic algorithms for split feasibility problems in Hilbert spaces. Nonlinear Anal. 74, 4105–4111 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Wang, F.: Polyak’s gradient method for split feasibility problem constrained by level sets. Numer. Algorithm‘s 77, 925–938 (2018)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Wang, F.: A new method for split common fixed-point problem without priori knowledge of operator norms. J. Fixed Point Theory Appl. 19, 2427–2436 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Xu, H.K.: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces. Inverse Probl. 26, 105018 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Martinez-Yanes, C., Xu, H.K.: Strong convergence of the CQ method for fixed point iteration processes. Nonlinear Anal. 64, 2400–2411 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  26. 26.
    Yang, Q.: The relaxed CQ algorithm for solving the split feasibility problem. Inverse Probl. 20, 1261–1266 (2004)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Faculty of Mathematics, Mechanics, and InformaticsVietnam National UniversityHanoiVietnam
  2. 2.Department of MathematicsUniversity of Transport and CommunicationsHanoiVietnam

Personalised recommendations