A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints

被引:11
|
作者
Petrot, Narin [1 ,2 ]
Prangprakhon, Mootta [3 ]
Promsinchai, Porntip [1 ,2 ]
Nimana, Nimit [3 ]
机构
[1] Naresuan Univ, Fac Sci, Dept Math, Phitsanulok 65000, Thailand
[2] Naresuan Univ, Fac Sci, Ctr Excellence Nonlinear Anal & Optimizat, Phitsanulok 65000, Thailand
[3] Khon Kaen Univ, Fac Sci, Dept Math, Khon Kaen 40002, Thailand
关键词
Variational inequality; Fixed-point set; Firmly nonexpansive operator; Conjugate gradient method; Machine learning; FEASIBILITY PROBLEMS; PROJECTION METHOD; CONVEX; INTERSECTION; CONVERGENCE; PRODUCT; SET; ALGORITHMS; OPERATOR;
D O I
10.1007/s11075-022-01430-8
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we propose a dynamic distributed conjugate gradient method for solving the strongly monotone variational inequality problem over the intersection of fixed-point sets of firmly nonexpansive operators. The proposed method allows the independent computation of a firmly nonexpansive operator along with the dynamic weight which is updated at each iteration. This strategy aims to speed up the convergence behavior of the algorithm by updating control factors to drive each iterative step. Under some suitable control conditions on corresponding parameters, we show a strong convergence of the iterate to the unique solution of the considered variational inequality problem. We consider the numerical experiments and discuss some observation points by applying the model to solve the image classification problem via the support vector machine learning.
引用
收藏
页码:639 / 668
页数:30
相关论文
共 50 条