Proximal type algorithms involving linesearch and inertial technique for split variational inclusion problem in hilbert spaces with applications S Kesornprom, P Cholamjiak Optimization 68 (12), 2369-2395, 2019 | 52 | 2019 |
On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem S Kesornprom, N Pholasa, P Cholamjiak Numerical Algorithms 84, 997-1017, 2020 | 44 | 2020 |
Modified proximal algorithms for finding solutions of the split variational inclusions S Suantai, S Kesornprom, P Cholamjiak Mathematics 7 (8), 708, 2019 | 18 | 2019 |
A new hybrid CQ algorithm for the split feasibility problem in Hilbert spaces and its applications to compressed sensing S Suantai, S Kesornprom, P Cholamjiak Mathematics 7 (9), 789, 2019 | 16 | 2019 |
VISCOSITY APPROXIMATION METHODS FOR FIXED POINT PROBLEMS IN HILBERT SPACES ENDOWED WITH GRAPHS. W Cholamjiak, S Suantai, R Suparatulatorn, S Kesornprom, P Cholamjiak Journal of Applied & Numerical Optimization 1 (1), 2019 | 11 | 2019 |
Weak and strong convergence theorems for the inclusion problem and the fixed-point problem of nonexpansive mappings P Cholamjiak, S Kesornprom, N Pholasa Mathematics 7 (2), 167, 2019 | 9 | 2019 |
A modified inertial proximal gradient method for minimization problems and applications S Kesornprom, P Cholamjiak AIMS Mathematics 7 (5), 8147-8161, 2022 | 6 | 2022 |
A new hybrid CQ algorithm for the split feasibility problem in Hilbert spaces and its applications to compressed sensing, Mathematics, 7 (2019), 789 S Suantai, S Kesornprom, P Cholamjiak | 5 | |
Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration S Suantai, B Panyanak, S Kesornprom, P Cholamjiak Optimization Letters, 1-20, 2022 | 4 | 2022 |
Modified projection method with inertial technique and hybrid stepsize for the split feasibility problem S Suantai, S Kesornprom, W Cholamjiak, P Cholamjiak Mathematics 10 (6), 933, 2022 | 4 | 2022 |
A relaxed projection method using a new linesearch for the split feasibility problem S Suantai, S Kesornprom, N Pholasa, YJ Cho, P Cholamjiak AIMS Math 6 (3), 2690-2703, 2021 | 4 | 2021 |
S-iteration process for asymptotic pointwise nonexpansive mappings in complete hyperbolic metric spaces T Atsathi, P Cholamjiak, S Kesornprom, A Prasong Communications of the Korean Mathematical Society 31 (3), 575-583, 2016 | 4 | 2016 |
New proximal type algorithms for convex minimization and its application to image deblurring S Kesornprom, P Cholamjiak, C Park Computational and Applied Mathematics 41 (7), 333, 2022 | 3 | 2022 |
A modified CQ algorithm for solving the multiple-sets split feasibility problem and the fixed point problem for nonexpansive mappings S Kesornprom, N Pholasa, P Cholamjiak Thai Journal of Mathematics 17 (2), 475-493, 2019 | 3 | 2019 |
On inertial relaxation CQ algorithm for split feasibility problems S Kesornprom, P Cholamjiak Communications in Mathematics and Applications 10 (2), 245, 2019 | 3 | 2019 |
Strong convergence of the modified projection and contraction methods for split feasibility problem S Kesornprom, P Cholamjiak Thai Journal of Mathematics, 76-94, 2018 | 3 | 2018 |
A double proximal gradient method with new linesearch for solving convex minimization problem with application to data classification S Kesornprom, P Cholamjiak Results in Nonlinear Analysis 5 (4), 412-422, 2022 | 2 | 2022 |
A new iterative scheme using inertial technique for the split feasibility problem with application to compressed sensing S Kesornprom, P Cholamjiak Thai Journal of Mathematics 18 (1), 315-332, 2020 | 1 | 2020 |
Strong Convergence of the Inertial Proximal Algorithm for the Split Variational Inclusion Problem in Hilbert Spaces S Kesornprom, N Pholasa Thai Journal of Mathematics 18 (3), 1401-1415, 2020 | 1 | 2020 |
A novel relaxed projective method for split feasibility problems T Saelii, S Kesornprom, P Cholamjiak Thai Journal of Mathematics 18 (3), 1359-1373, 2020 | 1 | 2020 |