Adisak Hanjing
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Adisak Hanjing has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Suthep Suantai
Department of Mathematics, Faculty of Science, Chiang Mai University
5 shared publications Suthep Suantai
Data Science Research Center, Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai, Thailand
2 shared publicationsPachara Jailoka
Data Science Research Center, Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai, 50200, Thailand
1 shared publication- Pachara Jailoka
Chiang Mai Univ, Dept Math, Fac Sci, Chiang Mai 50200, Thailand
1 shared publication Pornsak Yatakoat
Department of Mathematics, Faculty of Science, Nakhon Phanom University, Nakhon Phanom, Thailand
1 shared publication- Yeol Je Cho
Department of Mathematics Education, Gyeongsang National University, Jinju, Republic of Korea
1 shared publication
Latest Publications
- Open Access
- 1 January 2023
- Published by National Library of Serbia in Filomat
- Vol. 37 (5) , 1607-1623
Hybrid inertial accelerated extragradient algorithms for split pseudomonotone equilibrium problems and fixed point problems of demicontractive mappings
In this paper, we present a new hybrid extragradient algorithm for finding a common element of the fixed point problem for a demicontractive mapping and the split equilibrium problem for a pseudomonotone and Lipschitz-type continuous bifunction. By using a new technique of choosing the step size of the proposed method, our algorithms do not need any prior information of the operator norm. In fact, we propose an inertial type algorithm in order to accelerate its convergence rate and then prove strong convergence theorem of our proposed method under some control conditions. Moreover, we give some numerical experiments to support our main results.
- 1 January 2023
- Published by National Library of Serbia in Filomat
- Vol. 37 (5) , 1607-1623
Open AccessHybrid inertial accelerated extragradient algorithms for split pseudomonotone equilibrium problems and fixed point problems of demicontractive mappings
In this paper, we present a new hybrid extragradient algorithm for finding a common element of the fixed point problem for a demicontractive mapping and the split equilibrium problem for a pseudomonotone and Lipschitz-type continuous bifunction. By using a new technique of choosing the step size of the proposed method, our algorithms do not need any prior information of the operator norm. In fact, we propose an inertial type algorithm in order to accelerate its convergence rate and then prove strong convergence theorem of our proposed method under some control conditions. Moreover, we give some numerical experiments to support our main results.
- Open Access
- 17 March 2022
- Published by Springer Nature in Advances in Continuous and Discrete Models
- Vol. 2022 (1) , 1-18
On some accelerated optimization algorithms based on fixed point and linesearch techniques for convex minimization problems with applications
- 17 March 2022
- Published by Springer Nature in Advances in Continuous and Discrete Models
- Vol. 2022 (1) , 1-18
Open AccessOn some accelerated optimization algorithms based on fixed point and linesearch techniques for convex minimization problems with applications
- 15 July 2021
- Published by Technical University of Cluj Napoca, North University Center of Baia Mare in Carpathian Journal of Mathematics
- Vol. 37 (3) , 449-461
A fast viscosity forward-backward algorithm for convex minimization problems with an application in image recovery
The purpose of this paper is to invent an accelerated algorithm for the convex minimization problem which can be applied to the image restoration problem. T
- 15 July 2021
- Published by Technical University of Cluj Napoca, North University Center of Baia Mare in Carpathian Journal of Mathematics
- Vol. 37 (3) , 449-461
A fast viscosity forward-backward algorithm for convex minimization problems with an application in image recovery
The purpose of this paper is to invent an accelerated algorithm for the convex minimization problem which can be applied to the image restoration problem. T
- Open Access
- 27 February 2021
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2021 (1) , 1-19
An accelerated viscosity forward-backward splitting algorithm with the linesearch process for convex minimization problems
- 27 February 2021
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2021 (1) , 1-19
Open AccessAn accelerated viscosity forward-backward splitting algorithm with the linesearch process for convex minimization problems
- 1 July 2020
- Published by Babes-Bolyai University Cluj-Napoca in Fixed Point Theory
- Vol. 21 (2) , 507-524
The split fixed point problem for demicontractive mappings and applications
- 1 July 2020
- Published by Babes-Bolyai University Cluj-Napoca in Fixed Point Theory
- Vol. 21 (2) , 507-524
The split fixed point problem for demicontractive mappings and applications
- Open Access
- 8 March 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (3) , 378
A Fast Image Restoration Algorithm Based on a Fixed Point and Optimization Method
In this paper, a new accelerated fixed point algorithm for solving a common fixed point of a family of nonexpansive operators is introduced and studied, and then a weak convergence result and the convergence behavior of the proposed method is proven and discussed. Using our main result, we obtain a new accelerated image restoration algorithm, called the forward-backward modified W-algorithm (FBMWA), for solving a minimization problem in the form of the sum of two proper lower semi-continuous and convex functions. As applications, we apply the FBMWA algorithm to solving image restoration problems. We analyze and compare convergence behavior of our method with the others for deblurring the image. We found that our algorithm has a higher efficiency than the others in the literature.
- 8 March 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (3) , 378
Open AccessA Fast Image Restoration Algorithm Based on a Fixed Point and Optimization Method
In this paper, a new accelerated fixed point algorithm for solving a common fixed point of a family of nonexpansive operators is introduced and studied, and then a weak convergence result and the convergence behavior of the proposed method is proven and discussed. Using our main result, we obtain a new accelerated image restoration algorithm, called the forward-backward modified W-algorithm (FBMWA), for solving a minimization problem in the form of the sum of two proper lower semi-continuous and convex functions. As applications, we apply the FBMWA algorithm to solving image restoration problems. We analyze and compare convergence behavior of our method with the others for deblurring the image. We found that our algorithm has a higher efficiency than the others in the literature.
- 5 February 2020
- Published by Springer Nature in Numerical Algorithms
- Vol. 85 (3) , 1051-1073
Hybrid inertial accelerated algorithms for split fixed point problems of demicontractive mappings and equilibrium problems
- 5 February 2020
- Published by Springer Nature in Numerical Algorithms
- Vol. 85 (3) , 1051-1073
Hybrid inertial accelerated algorithms for split fixed point problems of demicontractive mappings and equilibrium problems