default search action
Watcharaporn Cholamjiak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Pronpat Peeyada, Watcharaporn Cholamjiak:
A new projection algorithm for variational inclusion problems and its application to cervical cancer disease prediction. J. Comput. Appl. Math. 441: 115702 (2024) - [j12]Nipa Jun-On, Watcharaporn Cholamjiak:
Enhanced Double Inertial Forward-Backward Splitting Algorithm for Variational Inclusion Problems: Applications in Mathematical Integrated Skill Prediction. Symmetry 16(8): 1091 (2024) - 2022
- [j11]Kunrada Kankam, Watcharaporn Cholamjiak, Prasit Cholamjiak:
Convergence Analysis of a Modified Forward-Backward Splitting Algorithm for Minimization and Application to Image Recovery. Comput. Math. Methods 2022: 1-9 (2022) - 2021
- [j10]Suthep Suantai, Kunrada Kankam, Prasit Cholamjiak, Watcharaporn Cholamjiak:
A parallel monotone hybrid algorithm for a finite family of $$G-$$nonexpansive mappings in Hilbert spaces endowed with a graph applicable in signal recovery. Comput. Appl. Math. 40(4) (2021) - [j9]Damrongsak Yambangwai, Watcharaporn Cholamjiak, Tanakit Thianwan, Hemen Dutta:
On a new weight tri-diagonal iterative method and its applications. Soft Comput. 25(1): 725-740 (2021) - [j8]Damrongsak Yambangwai, Suhel Ahmad Khan, Hemen Dutta, Watcharaporn Cholamjiak:
Image restoration by advanced parallel inertial forward-backward splitting methods. Soft Comput. 25(8): 6029-6042 (2021) - 2020
- [j7]Watcharaporn Cholamjiak, Damrongsak Yambangwai, Hemen Dutta, Hasanen A. Hammad:
Modified CQ-Algorithms for G-Nonexpansive Mappings in Hilbert Spaces Involving Graphs. New Math. Nat. Comput. 16(1): 89-103 (2020)
2010 – 2019
- 2018
- [j6]Suhel Ahmad Khan, Watcharaporn Cholamjiak:
Mixed variational inequalities with various error bounds for random fuzzy mappings. J. Intell. Fuzzy Syst. 34(4): 2313-2324 (2018) - [j5]Raweerote Suparatulatorn, Watcharaporn Cholamjiak, Suthep Suantai:
A modified S-iteration process for G-nonexpansive mappings in Banach spaces with graphs. Numer. Algorithms 77(2): 479-490 (2018) - 2017
- [j4]Raweerote Suparatulatorn, Suthep Suantai, Watcharaporn Cholamjiak:
Hybrid methods for a finite family of G-nonexpansive mappings in Hilbert spaces endowed with graphs. AKCE Int. J. Graphs Comb. 14(2): 101-111 (2017) - 2012
- [j3]Suthep Suantai, Watcharaporn Cholamjiak, Prasit Cholamjiak:
An implicit iteration process for solving a fixed point problem of a finite family of multi-valued mappings in Banach spaces. Appl. Math. Lett. 25(11): 1656-1660 (2012) - 2011
- [j2]Watcharaporn Cholamjiak, Suthep Suantai:
Approximation of common fixed points of two quasi-nonexpansive multi-valued maps in Banach spaces. Comput. Math. Appl. 61(4): 941-949 (2011) - 2010
- [j1]Watcharaporn Cholamjiak, Suthep Suantai:
Weak and strong convergence theorems for a finite family of generalized asymptotically quasi-nonexpansive mappings. Comput. Math. Appl. 60(7): 1917-1923 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint