Communications in Mathematics and Applications
http://www.rgnpublications.com/journals/index.php/cma
<p><span>The journal “<strong>Communications in Mathematics and Applications”</strong></span><span> (CMA) is being regularly published since 2010. </span><span>The “</span><strong>Communications in Mathematics and Applications</strong><span>” is an international journal devoted to the publication of original and high-quality research of pure mathematics.</span></p><p><strong>Subjects covered by <strong>Communications in Mathematics and Applications</strong>: </strong></p><ul><li><strong>Algebra <br /></strong></li><li><strong>Algebraic Geometry <br /></strong></li><li><strong>Analysis <br /></strong></li><li><strong>Category Theory <br /></strong></li><li><strong>Graph Theory <br /></strong></li><li><strong>Mathematical Logic & Foundations <br /></strong></li><li><strong>Number Theory <br /></strong></li><li><strong>Philosophy of Mathematics <br /></strong></li><li><strong>Topology</strong></li></ul><p>To ensure speedy publication, only articles which are sufficiently well presented, containing significant results and not required major revisions will be considered. The papers are accepted only after peer review.</p><p>Editorial decisions on acceptance or otherwise are taken within 4 to 8 weeks (two months) of receipt of the paper.</p><p>The journal will also publish survey articles giving details of research progress made during the last three decades in a particular area.</p><p><img src="/journals/icons/cma/icore.jpg" alt="" /></p>RGN Publicationsen-USCommunications in Mathematics and Applications0976-5905Authors who publish with this journal agree to the following terms:<br /><ul><li>Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.</li><li>Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.</li><li>Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.</li></ul>A Modified Inertial Shrinking Projection Method for Solving Inclusion Problems and Split Equilibrium Problems in Hilbert Spaces
http://www.rgnpublications.com/journals/index.php/cma/article/view/1074
<p>In this paper, we propose a modified inertial forward-backward splitting method for solving the split equilibrium problem and the inclusion problem. Then we establish the weak convergence theorem of the proposed method. Using the shrinking projection method, we obtain strong convergence theorem. Moreover, we provide some numerical experiments to show the efficiency and the comparison.</p>Watcharaporn CholamjiakSuhel Ahmad KhanSuthep Suantai2019-06-302019-06-3010Coupled Random Fixed Point Theorems for Mixed Monotone Nonlinear Operators
http://www.rgnpublications.com/journals/index.php/cma/article/view/1083
<p>In this paper, we prove the existence of a random coupled coincidence and coupled random fixed point theorems in complete separable metric space without the mixed \(g\)-monotone property. The results are used to prove existence of random solutions for random integral equation.</p>Chayut KongbanPoom KumamJuan Martínez-Moreno2019-06-302019-06-3010Acceleration of the Modified \(S\)-Algorithm to Search for a Fixed Point of a Nonexpansive Mapping
http://www.rgnpublications.com/journals/index.php/cma/article/view/1071
<p>The purpose of this paper is to present accelerations of the \(S\)-algorithm. We first apply the Picard algorithm to the smooth convex minimization problem and point out that the Picard algorithm is the steepest descent method for solving the minimization problem. Next, we provide the accelerated Picard algorithm by using the ideas of conjugate gradient methods that accelerated the steepest descent method. Then, based on the accelerated Picard algorithm, we present accelerations of the \(S\)-algorithm. Under certain assumptions, our algorithm strongly converges to a fixed point with the S-algorithm and show that it dramatically reduces the running time and iteration needed to find a fixed point compared with that algorithm.</p>D. KitkuanJ. ZhaoH. ZongW. Kumam2019-06-302019-06-3010On Inertial Relaxation CQ Algorithm for Split Feasibility Problems
http://www.rgnpublications.com/journals/index.php/cma/article/view/1072
<p>In this work, we introduce an inertial relaxation CQ algorithm for the split feasibility problem in Hilbert spaces. We prove weak convergence theorem under suitable conditions. Numerical examples illustrating our methods’s efficiency are presented for comparing some known methods.</p>Suparat KesornpromPrasit Cholamjiak2019-06-302019-06-3010Some Fixed Point of Hardy-Rogers Contraction in Generalized Complex Valued Metric Spaces
http://www.rgnpublications.com/journals/index.php/cma/article/view/1077
<p>In this work, we defined the generalized complex valued metric space for some partial order relation and give some example. Then we study and established a fixed point theorem for general Hardy-Rogers contraction. The results extend and improve some results of Elkouch and Marhrani [5].</p>Issara InchanUrairat Deepan2019-06-302019-06-3010A Modified Subgradient Extragradient Algorithm with Inertial Effects
http://www.rgnpublications.com/journals/index.php/cma/article/view/1078
<p>In this article, we introduce an inertial modified subgradient extragradient method by combining inertial type algorithm with modified subgradient extragradient method and for solving the variational inequality (VI) in a Hilbert space \(H\). Also, we establish a weak convergence theorem for proposed algorithm. Finally, we describe the performance of our proposed algorithm with the help of numerical experiment and we show the efficiency and advantage of the inertial modified subgradient extragradient method.</p>Somayya KomalPoom Kumam2019-06-302019-06-3010Best Proximity Point Results for Quasi Contractions of Perov Type in Non-Normal Cone Metric Space
http://www.rgnpublications.com/journals/index.php/cma/article/view/1079
<p>In this paper, we study the notion of Ciric-Perov quasi contraction and Fisher-Perov quasi contraction and prove some best proximity point theorems for such contractions in the frame work of non-normal regular cone metric spaces. We give an example to support our result. Our results extend and generalized many existing results in literature.</p>Azhar HussainMujahid AbbasJamshaid AhmadAbdullah Eqal Al-Mazrooei2019-06-302019-06-3010Convergence Theorem for Nonexpansive Semigroups in \(q\)-Uniformly Smooth Banach Spaces
http://www.rgnpublications.com/journals/index.php/cma/article/view/1080
<p>In this paper, we present the iterative scheme nonexpansive semigroups in the framework of \(q\)-uniformly smooth and uniformly convex Banach spaces. Furthermore, we propose the strong convergence theorem for finding fixed points problem of nonexpansive semigroups under some appropriate conditions. Our results extend the recent ones of some authors.</p>Uamporn WitthayaratKriengsak Wattanawitoon2019-06-302019-06-3010Convergence Analysis of Two Demicontractive Operators
http://www.rgnpublications.com/journals/index.php/cma/article/view/1084
<p>In this paper, first we introduce a new iterative scheme involving demicontractive mappings in Hilbert spaces which does not require prior knowledge of operator norm and, second, by using the proposed scheme, prove some strong convergence theorems. Finally, we give some numerical examples to illustrate our main result.</p>Jiraporn JanwisedChuanpit TunchonnangPheerachate BunpatcharacharoenNaknimit Akkasriworn2019-06-302019-06-3010Iterative Methods for Solving the Proximal Split Feasibility Problems
http://www.rgnpublications.com/journals/index.php/cma/article/view/1082
<p>In this work, we study the proximal split feasibility problem. We introduce a new algorithm with inertial technique for solving this problem in Hilbert spaces. We also prove the strong convergence theorem under some suitable conditions. Finally, we give some numerical experiments to support our results.</p>Manatsawin MamatRaweerote SuparatulatornPrasit Cholamjiak2019-06-302019-06-3010