IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i3p226-d209808.html
   My bibliography  Save this article

A General Algorithm for the Split Common Fixed Point Problem with Its Applications to Signal Processing

Author

Listed:
  • Wachirapong Jirakitpuwapat

    (KMUTT-Fixed Point Research Laboratory, Room SCL 802 Fixed Point Laboratory, Science Laboratory Building, Department of Mathematics, Faculty of Science, King Mongkut’s University of Technology Thonburi (KMUTT), 126 Pracha Uthit Rd., Bang Mod, Thung Khru, Bangkok 10140, Thailand
    These authors contributed equally to this work.)

  • Poom Kumam

    (KMUTT-Fixed Point Theory and Applications Research Group, Theoretical and Computational Science Center (TaCS), Science Laboratory Building, Faculty of Science, King Mongkut’s University of Technology Thonburi (KMUTT), 126 Pracha-Uthit Road, Bang Mod, Thrung Khru, Bangkok 10140, Thailand
    Department of Medical Research, China Medical University Hospital, China Medical University, Taichung 40402, Taiwan
    These authors contributed equally to this work.)

  • Yeol Je Cho

    (KMUTT-Fixed Point Theory and Applications Research Group, Theoretical and Computational Science Center (TaCS), Science Laboratory Building, Faculty of Science, King Mongkut’s University of Technology Thonburi (KMUTT), 126 Pracha-Uthit Road, Bang Mod, Thrung Khru, Bangkok 10140, Thailand
    Department of Mathematics Education, Gyeongsang National University, Jinju 52828, Korea
    School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu 611731, China
    These authors contributed equally to this work.)

  • Kanokwan Sitthithakerngkiet

    (Department of Mathematics, Faculty of Applied Science, King Mongkut’s University of Technology North Bangkok (KMUTNB), Wongsawang, Bangsue, Bangkok 10800, Thailand
    These authors contributed equally to this work.)

Abstract

In 2014, Cui and Wang constructed an algorithm for demicontractive operators and proved some weak convergence theorems of their proposed algorithm to show the existence of solutions for the split common fixed point problem without using the operator norm. By Cui and Wang’s motivation, in 2015, Boikanyo constructed also a new algorithm for demicontractive operators and obtained some strong convergence theorems for this problem without using the operator norm. In this paper, we consider a viscosity iterative algorithm in Boikanyo’s algorithm to approximate to a solution of this problem and prove some strong convergence theorems of our proposed algorithm to a solution of this problem. Finally, we apply our main results to some applications, signal processing and others and compare our algorithm with five algorithms such as Cui and Wang’s algorithm, Boikanyo’s algorithm, forward-backward splitting algorithm and the fast iterative shrinkage-thresholding algorithm (FISTA).

Suggested Citation

  • Wachirapong Jirakitpuwapat & Poom Kumam & Yeol Je Cho & Kanokwan Sitthithakerngkiet, 2019. "A General Algorithm for the Split Common Fixed Point Problem with Its Applications to Signal Processing," Mathematics, MDPI, vol. 7(3), pages 1-20, February.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:3:p:226-:d:209808
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/3/226/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/3/226/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Boikanyo, Oganeditse A., 2015. "A strongly convergent algorithm for the split common fixed point problem," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 844-853.
    2. NESTEROV, Yu., 2007. "Gradient methods for minimizing composite objective function," LIDAM Discussion Papers CORE 2007076, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. H.K. Xu, 2003. "An Iterative Approach to Quadratic Optimization," Journal of Optimization Theory and Applications, Springer, vol. 116(3), pages 659-678, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Umberto Amato & Anestis Antoniadis & Italia De Feis & Irene Gijbels, 2021. "Penalised robust estimators for sparse and high-dimensional linear models," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 30(1), pages 1-48, March.
    2. Mingqiang Li & Congying Han & Ruxin Wang & Tiande Guo, 2017. "Shrinking gradient descent algorithms for total variation regularized image denoising," Computational Optimization and Applications, Springer, vol. 68(3), pages 643-660, December.
    3. Hansen, Christian & Liao, Yuan, 2019. "The Factor-Lasso And K-Step Bootstrap Approach For Inference In High-Dimensional Economic Applications," Econometric Theory, Cambridge University Press, vol. 35(3), pages 465-509, June.
    4. Rattanaporn Wangkeeree & Rabian Wangkeeree, 2013. "The general iterative methods for nonexpansive semigroups in Banach spaces," Journal of Global Optimization, Springer, vol. 55(2), pages 417-436, February.
    5. Umberto Amato & Anestis Antoniadis & Italia Feis & Irène Gijbels, 2022. "Penalized wavelet estimation and robust denoising for irregular spaced data," Computational Statistics, Springer, vol. 37(4), pages 1621-1651, September.
    6. Silvia Villa & Lorenzo Rosasco & Sofia Mosci & Alessandro Verri, 2014. "Proximal methods for the latent group lasso penalty," Computational Optimization and Applications, Springer, vol. 58(2), pages 381-407, June.
    7. Eric U. Ofoedu, 2013. "A General Approximation Scheme for Solutions of Various Problems in Fixed Point Theory," International Journal of Analysis, Hindawi, vol. 2013, pages 1-18, January.
    8. Kenneth Lange & Eric C. Chi & Hua Zhou, 2014. "A Brief Survey of Modern Optimization for Statisticians," International Statistical Review, International Statistical Institute, vol. 82(1), pages 46-70, April.
    9. D. Russell Luke & Nguyen H. Thao & Matthew K. Tam, 2018. "Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1143-1176, November.
    10. Uthai Kamraksa & Rabian Wangkeeree, 2011. "Generalized equilibrium problems and fixed point problems for nonexpansive semigroups in Hilbert spaces," Journal of Global Optimization, Springer, vol. 51(4), pages 689-714, December.
    11. Qihang Lin & Lin Xiao, 2015. "An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization," Computational Optimization and Applications, Springer, vol. 60(3), pages 633-674, April.
    12. Giuseppe Marino & Hong-Kun Xu, 2011. "Explicit Hierarchical Fixed Point Approach to Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 149(1), pages 61-78, April.
    13. Zachary F. Fisher & Younghoon Kim & Barbara L. Fredrickson & Vladas Pipiras, 2022. "Penalized Estimation and Forecasting of Multiple Subject Intensive Longitudinal Data," Psychometrika, Springer;The Psychometric Society, vol. 87(2), pages 1-29, June.
    14. Yao Dong & He Jiang, 2018. "A Two-Stage Regularization Method for Variable Selection and Forecasting in High-Order Interaction Model," Complexity, Hindawi, vol. 2018, pages 1-12, November.
    15. Radu-Alexandru Dragomir & Alexandre d’Aspremont & Jérôme Bolte, 2021. "Quartic First-Order Methods for Low-Rank Minimization," Journal of Optimization Theory and Applications, Springer, vol. 189(2), pages 341-363, May.
    16. Nattakarn Kaewyong & Kanokwan Sitthithakerngkiet, 2022. "An Inertial Extragradient Direction Method with Self-Adaptive Step Size for Solving Split Minimization Problems and Its Applications to Compressed Sensing," Mathematics, MDPI, vol. 10(6), pages 1-25, March.
    17. Qihang Lin & Xi Chen & Javier Peña, 2014. "A sparsity preserving stochastic gradient methods for sparse regression," Computational Optimization and Applications, Springer, vol. 58(2), pages 455-482, June.
    18. Xiubo Liang & Guoqiang Wang & Bo Yu, 2022. "A reduced proximal-point homotopy method for large-scale non-convex BQP," Computational Optimization and Applications, Springer, vol. 81(2), pages 539-567, March.
    19. Himanshu Baranwal & Ravindra Kishor Bisht & Arya Kumar Bedabrata Chand & Jen-Chih Yao, 2024. "Fixed-Point and Random Fixed-Point Theorems in Preordered Sets Equipped with a Distance Metric," Mathematics, MDPI, vol. 12(18), pages 1-30, September.
    20. ChangAn Tian & Yisheng Song, 2013. "Strong convergence of a regularization method for Rockafellar’s proximal point algorithm," Journal of Global Optimization, Springer, vol. 55(4), pages 831-837, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:7:y:2019:i:3:p:226-:d:209808. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.