Now showing 1 - 4 of 4
  • Some of the metrics are blocked by your 
    Item type:Publication,
    A three-intermixed algorithm for common fixed point problems with applications to convex optimization and network allocation
    (2026-07-01)
    Saechou, Kanyanee
    ;
    This study investigates a new algorithm, termed the three-intermixed algorithm, developed from the intermixed algorithm introduced by Yao et al. (Fixed Point Theory Appl 206, 2015). A strong convergence theorem is established for finding a common element in the set of fixed points of nonexpansive mappings. To illustrate our main theorem, we provide an example in R2 along with a graphical representation showing the behavior of the sequences {xn},{yn}, and {zn}. Beyond theoretical development, the applicability of the main theorem is demonstrated through several important problems, including the convex minimization problem, the split feasibility problem, and both general and new systems of variational inequality problems. In addition, a special case of the main theorem is applied to the network bandwidth allocation problem. A detailed numerical example is presented to show how the proposed iterative scheme can be used to compute a proportionally fair allocation under capacity and minimum rate constraints, thereby confirming the practical efficiency of the method.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Modified subgradient extragradient method for system of variational inclusion problem and finite family of variational inequalities problem in real Hilbert space
    (2021-01-01)
    Kheawborisut, Araya
    ;
    For the purpose of this article, we introduce a modified form of a generalized system of variational inclusions, called the generalized system of modified variational inclusion problems (GSMVIP). This problem reduces to the classical variational inclusion and variational inequalities problems. Motivated by several recent results related to the subgradient extragradient method, we propose a new subgradient extragradient method for finding a common element of the set of solutions of GSMVIP and the set of a finite family of variational inequalities problems. Under suitable assumptions, strong convergence theorems have been proved in the framework of a Hilbert space. In addition, some numerical results indicate that the proposed method is effective.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    A theorem for solving Banach generalized system of variational inequality problems and fixed point problem in uniformly convex and 2-uniformly smooth Banach space
    (2021-04-01)
    Chaloemyotphong, Bunyawee
    ;
    In this paper, we consider a Banach generalized system of variational inequality problems by using the concept of Kangtunyakarn (Fixed Point Theory Appl 2014:123, 2014) and showed the equivalence between a Banach generalized system of variational inequality problems and fixed point problems. And also, using modified viscosity iterative method, we prove a strong convergence theorem for finding a common solution of a Banach generalized system of variational inequality problems and fixed point problems for a nonexpansive mapping. The main theorem presented in this paper extend the corresponding result of variational inequality problems introduced by Aoyama et al. (Fixed Point Theory Appl 2006:35390, https://doi.org/10.1155/FPTA/2006/35390, 2006). Moreover, we give some numerical examples for supporting our main theorem.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    The method for solving the extension of general of the split feasibility problem and fixed point problem of the cutter
    (2022-01-01)
    Saechou, Kanyanee
    ;
    This paper first introduces a new iterative method for weak and strong convergence theorem to demonstrate the estimation potential for a fixed point of the cutter and the finite general split feasibility problem. Consequently, the set of fixed points of a quasi-nonexpansive mapping and the finite general split feasibility problem, the constrained minimization problem, and the general constrained minimization problems are proved using our main results. Finally, we give two numerical examples to advocate our main results.