在具有图的Hilbert空间中，用$G$-次梯度法逼近$G$-变分不等式问题

IF 1.4 4区数学 Q1 MATHEMATICS

Carpathian Journal of Mathematics Pub Date : 2022-12-21 DOI:10.37193/cjm.2023.02.02

Autcha Araveeporn, Araya Kheawborisut, A. Kangtunyakarn

{"title":"在具有图的Hilbert空间中，用$G$-次梯度法逼近$G$-变分不等式问题","authors":"Autcha Araveeporn, Araya Kheawborisut, A. Kangtunyakarn","doi":"10.37193/cjm.2023.02.02","DOIUrl":null,"url":null,"abstract":"In this article, we introduce $G$-subgradient extragradient method for solving the $G$- variational inequality problem in Hilbert space endowed with a direct graph. Utilizing our mathematical tools, weak and strong convergence theorem are established for the proposed algorithm. In addition, we provide numerical experiments to illustrate the convergence behavior of our proposed algorithm.","PeriodicalId":50711,"journal":{"name":"Carpathian Journal of Mathematics","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2022-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Approximating $G$-variational inequality problem by $G$-subgradient extragradient method in Hilbert space endowed with graphs\",\"authors\":\"Autcha Araveeporn, Araya Kheawborisut, A. Kangtunyakarn\",\"doi\":\"10.37193/cjm.2023.02.02\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article, we introduce $G$-subgradient extragradient method for solving the $G$- variational inequality problem in Hilbert space endowed with a direct graph. Utilizing our mathematical tools, weak and strong convergence theorem are established for the proposed algorithm. In addition, we provide numerical experiments to illustrate the convergence behavior of our proposed algorithm.\",\"PeriodicalId\":50711,\"journal\":{\"name\":\"Carpathian Journal of Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2022-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Carpathian Journal of Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.37193/cjm.2023.02.02\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Carpathian Journal of Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.37193/cjm.2023.02.02","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

本文给出了求解Hilbert空间中具有直接图的$G$-变分不等式问题的$G$-次梯度外聚方法。利用数学工具，建立了该算法的弱收敛定理和强收敛定理。此外，我们还提供了数值实验来说明我们提出的算法的收敛性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Approximating $G$-variational inequality problem by $G$-subgradient extragradient method in Hilbert space endowed with graphs

In this article, we introduce $G$-subgradient extragradient method for solving the $G$- variational inequality problem in Hilbert space endowed with a direct graph. Utilizing our mathematical tools, weak and strong convergence theorem are established for the proposed algorithm. In addition, we provide numerical experiments to illustrate the convergence behavior of our proposed algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Carpathian Journal of Mathematics MATHEMATICS, APPLIED-MATHEMATICS

CiteScore

2.40

自引率

7.10%

发文量

审稿时长

>12 weeks

期刊介绍： Carpathian Journal of Mathematics publishes high quality original research papers and survey articles in all areas of pure and applied mathematics. It will also occasionally publish, as special issues, proceedings of international conferences, generally (co)-organized by the Department of Mathematics and Computer Science, North University Center at Baia Mare. There is no fee for the published papers but the journal offers an Open Access Option to interested contributors.