Kangtunyakarn, Atid

Loading...
Thumbnail Image
Preferred name
Kangtunyakarn, Atid
Alternative Name
Kangtunyakarn, A.
Main Affiliation
Email
atid.ka@kmitl.ac.th

Settings

Now showing 1 - 2 of 2
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    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
    ;
    Kangtunyakarn, Atid
    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.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    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
    ;
    Kangtunyakarn, Atid
    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.