Search

This paper introduces a new algorithm that combines the forward–backward splitting algorithms with a double inertial technique, utilizing the previous three iterations. The weak convergence theorem is established under certain mild conditions in a Hilbert space, including a relaxed inertial method in real numbers. An example of infinite dimension space is given with numerical results to support our proposed algorithm. The algorithm is applied to an asymmetrical educational dataset of students from 109 schools, utilizing asymmetric inputs as nine attributes to predict the output as students' mathematical integrated skills. The algorithm's performance is compared with other algorithms in the literature to demonstrate its effectiveness. The proposed algorithm demonstrates comparable precision, recall, accuracy, and F1 score but performs a relatively lower number of iterations. The contributions of each performance aspect to the mathematical integration skill of students are discussed to improve students' mathematical learning. [ABSTRACT FROM AUTHOR]

In this paper, we propose an inertial forward–backward splitting method for solving the modified variational inclusion problem. The concept of the proposed method is based on Cholamjiak's method. and Khuangsatung and Kangtunyakarn's method. Cholamjiak's inertial technique is utilized in the proposed method for increased acceleration. Moreover, we demonstrate that the proposed method strongly converges under appropriate conditions and apply the proposed method to solve the image restoration problem where the images have been subjected to various obscuring processes. In our example, we use the proposed method and Khuangsatung and Kangtunyakarn's method to restore two medical images. To compare image quality, we also evaluate the signal-to-noise ratio (SNR) of the proposed method to that of Khuangsatung and Kangtunyakarn's method. [ABSTRACT FROM AUTHOR]

The goal of this paper is to propose and investigate new iterative methods for examining an approximate solution of a fixed-point problem, an equilibrium problem, and a finite collection of variational inclusions in the Hadamard manifold's structure. Operating under some assumptions, we extend the proximal point algorithm to estimate the common solution of stated problems and obtain a strong convergence theorem for the common solution. We also present several consequences of the proposed iterative methods and their convergence results. [ABSTRACT FROM AUTHOR]

The goal of this study was to show how a modified variational inclusion problem can be solved based on Tseng's method. In this study, we propose a modified Tseng's method and increase the reliability of the proposed method. This method is to modify the relaxed inertial Tseng's method by using certain conditions and the parallel technique. We also prove a weak convergence theorem under appropriate assumptions and some symmetry properties and then provide numerical experiments to demonstrate the convergence behavior of the proposed method. Moreover, the proposed method is used for image restoration technology, which takes a corrupt/noisy image and estimates the clean, original image. Finally, we show the signal-to-noise ratio (SNR) to guarantee image quality. [ABSTRACT FROM AUTHOR]

In this article, we discuss the hierarchical fixed point and split monotone variational inclusion problems and propose a new iterative method with the inertial terms involving a step size to avoid the difficulty of calculating the operator norm in real Hilbert spaces. A strong convergence theorem of the proposed method is established under some suitable control conditions. Furthermore, the proposed method is modified and used to derive a scheme for solving the split problems. Finally, we compare and demonstrate the efficiency and applicability of our schemes for numerical experiments as well as an example in the field of image restoration. [ABSTRACT FROM AUTHOR]

In our paper, we propose two new iterative algorithms with Meir–Keeler contractions that are based on Tseng's method, the multi-step inertial method, the hybrid projection method, and the shrinking projection method to solve a monotone variational inclusion problem in Hilbert spaces. The strong convergence of the proposed iterative algorithms is proven. Using our results, we can solve convex minimization problems. [ABSTRACT FROM AUTHOR]

The relaxed inertial Tseng-type method for solving the inclusion problem involving a maximally monotone mapping and a monotone mapping is proposed in this article. The study modifies the Tseng forward-backward forward splitting method by using both the relaxation parameter, as well as the inertial extrapolation step. The proposed method follows from time explicit discretization of a dynamical system. A weak convergence of the iterates generated by the method involving monotone operators is given. Moreover, the iterative scheme uses a variable step size, which does not depend on the Lipschitz constant of the underlying operator given by a simple updating rule. Furthermore, the proposed algorithm is modified and used to derive a scheme for solving a split feasibility problem. The proposed schemes are used in solving the image deblurring problem to illustrate the applicability of the proposed methods in comparison with the existing state-of-the-art methods. [ABSTRACT FROM AUTHOR]