Browsing by Author "Kunrada Kankam"

Now showing 1 - 7 of 7
  • Default Image
    Item
    A CURRENT FORWARD-BACKWARD-FORWARD METHOD FOR INCLUSION PROBLEMS
    (American Institute of Mathematical Sciences, 2025) Kunrada Kankam; Prasit Cholamjiak
    This research presents the projection forward-backward-forward method based on two inertials. We combine linesearch and self-adaptive stepsize to select the stepsize in the proposed method. The weak convergence is established under mild assumptions without the assumptions on the Lipschitz constants. Finally, numerical experiments are performed, which explain the effectiveness of the proposed method. We provide practical applications in image inpainting problem. The results of our numerical analysis conclusively indicate that the proposed method exhibits greater efficiency than those previously recommended in literature. © 2025 American Institute of Mathematical Sciences. All rights reserved.
  • Default Image
    Item
    A double inertial embedded modified S-iteration algorithm for nonexpansive mappings: A classification approach for lung cancer detection
    (Elsevier B.V., 2025) Watcharaporn Yajai; Kunrada Kankam; Jen-Chih Yao; Watcharaporn Cholamjiak; W. Cholamjiak; Department of Mathematics, School of Science, University of Phayao, Phayao, 56000, Thailand; email: watcharaporn.ch@up.ac.th
    This paper introduces a double inertial embedded modified S-iteration algorithm for finding a common fixed point of nonexpansive mappings in a real Hilbert space. A weak convergence theorem is established under suitable conditions involving control parameters. Three algorithms are directly obtained for addressing split equilibrium problems through the equivalence of nonexpansive mappings. An illustrative example in an infinite-dimensional space is provided to substantiate the proposed main algorithm. Furthermore, we highlight the practical application of these algorithms in lung cancer screening, where they are employed to optimize three different machine learning models, thereby potentially improving patient outcomes. The efficiency of the proposed algorithms is validated through comparative analysis with existing algorithms. © 2025
  • Default Image
    Item
    A modified inertial projected forward–backward algorithm for convex optimization problems
    (Springer-Verlag Italia s.r.l., 2025) Kunrada Kankam; Papatsara Inkrong; Prasit Cholamjiak; P. Cholamjiak; School of Science, University of Phayao, Phayao, 56000, Thailand; email: prasit.ch@up.ac.th
    The primary objective of this study is to establish the convergence theorem associated with the modified inertial projected forward–backward algorithm using line search techniques. Many applications in applied sciences can be modeled as constrained convex minimization problems. Our numerical experiments offer practical applications for resolving image deblurring issues. The results of our numerical analysis conclusively indicate that the proposed algorithms exhibit greater efficiency than those previously introduced in the literature. © The Author(s), under exclusive licence to Springer-Verlag Italia S.r.l., part of Springer Nature 2024.
  • Default Image
    Item
    A VARIANT OF THE PROXIMAL GRADIENT METHOD FOR CONSTRAINED CONVEX MINIMIZATION PROBLEMS
    (Mathematical Research Press, 2024) Suparat Kesornprom; Kunrada Kankam; Papatsara Inkrong; Nattawut Pholasa; Prasit Cholamjiak; P. Cholamjiak; School of Science, University of Phayao, Phayao, 56000, Thailand; email: prasit.ch@up.ac.th
    This paper presents a new variant of the proximal gradient algorithm based on double inertial extrapolation to solve a constrained convex minimization problem in real Hilbert spaces. We discuss its weak convergence, including numerical image and signal recovery experiments to support the main results. Some comparisons with other algorithms are also provided. The experiments demonstrate that our method converges better than the other methods in the literature. ©2024 Journal of Nonlinear Functional Analysis.
  • Default Image
    Item
    An inertial projective forward-backward-forward algorithm for constrained convex minimization problems and application to cardiovascular disease prediction
    (International Scientific Research Publications, 2024) Prasit Cholamjiak; Watcharaporn Cholamjiak; Kunrada Kankam; P. Cholamjiak; School of Science, University of Phayao, Phayao, 56000, Thailand; email: prasit.ch@up.ac.th; W. Cholamjiak; School of Science, University of Phayao, Phayao, 56000, Thailand; email: watcharaporn.ch@up.ac.th; K. Kankam; Elementary Education Program, Faculty of Education, Suan Dusit University Lampang Center, Lampang, 52100, Thailand; email: kunradazzz@gmail.com
    In this paper, we introduce a novel machine learning algorithm designed for the classification of cardiovascular diseases. The proposed inertial projected forward-backward-forward algorithm is developed to address constrained minimization in Hilbert spaces, with a specific focus on improving the accuracy of disease classification. Utilizing inertial techniques, the algorithm employs a projected forward-backward-forward strategy, demonstrating convergence under mild conditions. Evaluation of the algorithm employs four essential performance metrics-accuracy, F1-score, recall, and precision to gauge its effectiveness compared to alternative classification models. Results indicate significant performance gains, achieving peak metrics of 77.50% accuracy, 71.57% precision, 91.27% recall, and 80.23% F1-score, thereby surpassing established benchmarks in machine learning models for cardiovascular disease classification. © 2025 All rights reserved.
  • Default Image
    Item
    Inertial iterative method for solving equilibrium problems and fixed point problems
    (Springer Nature, 2024) Min Li; Zhongbing Xie; Prasit Cholamjiak; Kunrada Kankam; Z. Xie; School of Mathematics and Statistics, Wuhan University, Wuhan, 430072, China; email: xzbmath@163.com
    In this paper, we present an inertial iterative method for solving pseudomonotone equilibrium and fixed point problems in Banach spaces. Under appropriate conditions, we improve the convergence efficiency of our proposed algorithm by introducing a new step size and iteration rule, and further derive a strong convergence theorem. Finally, we demonstrate through numerical experiments that our new algorithm compares favourably with existing methods in terms of convergence behaviour. © 2024, The Author(s) under exclusive licence to Sociedade Brasileira de Matem‡tica Aplicada e Computacional.
  • Default Image
    Item
    Three-step projected forwardÐbackward algorithms for constrained minimization problem
    (Springer Nature, 2025) Kunrada Kankam; Muhammad Aslam Noor; Prasit Cholamjiak; P. Cholamjiak; School of Science, University of Phayao, Phayao, 56000, Thailand; email: prasitch2008@yahoo.com
    We design new projective forwardÐbackward algorithms for constrained minimization problems. We then discuss its weak convergence via a new linesearch that the hypothesis on the Lipschitz constant of the gradient of functions is avoided. We provide its applications to solve image deblurring and image inpainting. Finally, we discuss the optimal selection of parameters that are proposed in algorithms in terms of PSNR and SSIM. It reveals that our new algorithm outperforms some recent methods introduced in the literature. © The Author(s) under exclusive licence to Korean Society for Informatics and Computational Applied Mathematics 2024.