# American Institute of Mathematical Sciences

• Previous Article
A new concave reformulation and its application in solving DC programming globally under uncertain environment
• JIMO Home
• This Issue
• Next Article
Differential equation approximation and enhancing control method for finding the PID gain of a quarter-car suspension model with state-dependent ODE
September  2020, 16(5): 2331-2349. doi: 10.3934/jimo.2019056

## Projection methods for solving split equilibrium problems

 Applied Analysis Research Group, Faculty of Mathematics and Statistics, Ton Duc Thang University, Ho Chi Minh City, Vietnam

* Corresponding author: dangvanhieu@tdtu.edu.vn

Received  July 2018 Revised  January 2019 Published  September 2020 Early access  May 2019

The paper considers a split inverse problem involving component equilibrium problems in Hilbert spaces. This problem therefore is called the split equilibrium problem (SEP). It is known that almost solution methods for solving problem (SEP) are designed from two fundamental methods as the proximal point method and the extended extragradient method (or the two-step proximal-like method). Unlike previous results, in this paper we introduce a new algorithm, which is only based on the projection method, for finding solution approximations of problem (SEP), and then establish that the resulting algorithm is weakly convergent under mild conditions. Several of numerical results are reported to illustrate the convergence of the proposed algorithm and also to compare with others.

Citation: Dang Van Hieu. Projection methods for solving split equilibrium problems. Journal of Industrial & Management Optimization, 2020, 16 (5) : 2331-2349. doi: 10.3934/jimo.2019056
##### References:

show all references

##### References:
Algorithm 1 for $(m, k) = (30, 20)$ and different sequences of $\beta_n$. The number of iterations is 360,353,339,360,355,376, respectively
Algorithm 1 for (m; k) = (60; 40) and different sequences of βn. The number of iterations is 258,333,336,326,291,293, respectively
Algorithm 1 for (m; k) = (100; 50) and different sequences of βn. The number of iterations is 215,236,283,280,321,290, respectively
Algorithm 1 for $(m, k) = (150,100)$ and different sequences of $\beta_n$. The number of iterations is 161,188,219,209,245,264, respectively
Experiment for the algorithms with $(m, k) = (30, 20)$. The number of iterations is 334,240,379,168,130, respectively
Experiment for the algorithms with (m; k) = (60; 40). The number of iterations is 326,221,292,129,108, respectively
Experiment for the algorithms with (m; k) = (100; 50). The number of iterations is 308,250,356,114, 89, respectively
Experiment for the algorithms with $(m, k) = (150,100)$. The number of iterations is 254,192,271, 87, 69, respectively
 [1] Jamilu Abubakar, Poom Kumam, Abor Isa Garba, Muhammad Sirajo Abdullahi, Abdulkarim Hassan Ibrahim, Wachirapong Jirakitpuwapat. An efficient iterative method for solving split variational inclusion problem with applications. Journal of Industrial & Management Optimization, 2021  doi: 10.3934/jimo.2021160 [2] Zeng-Zhen Tan, Rong Hu, Ming Zhu, Ya-Ping Fang. A dynamical system method for solving the split convex feasibility problem. Journal of Industrial & Management Optimization, 2021, 17 (6) : 2989-3011. doi: 10.3934/jimo.2020104 [3] Xueling Zhou, Meixia Li, Haitao Che. Relaxed successive projection algorithm with strong convergence for the multiple-sets split equality problem. Journal of Industrial & Management Optimization, 2021, 17 (5) : 2557-2572. doi: 10.3934/jimo.2020082 [4] Yazheng Dang, Jie Sun, Honglei Xu. Inertial accelerated algorithms for solving a split feasibility problem. Journal of Industrial & Management Optimization, 2017, 13 (3) : 1383-1394. doi: 10.3934/jimo.2016078 [5] Armin Lechleiter, Tobias Rienmüller. Factorization method for the inverse Stokes problem. Inverse Problems & Imaging, 2013, 7 (4) : 1271-1293. doi: 10.3934/ipi.2013.7.1271 [6] Preeyanuch Chuasuk, Ferdinard Ogbuisi, Yekini Shehu, Prasit Cholamjiak. New inertial method for generalized split variational inclusion problems. Journal of Industrial & Management Optimization, 2021, 17 (6) : 3357-3371. doi: 10.3934/jimo.2020123 [7] Chibueze Christian Okeke, Abdulmalik Usman Bello, Lateef Olakunle Jolaoso, Kingsley Chimuanya Ukandu. Inertial method for split null point problems with pseudomonotone variational inequality problems. Numerical Algebra, Control & Optimization, 2021  doi: 10.3934/naco.2021037 [8] Ya-zheng Dang, Jie Sun, Su Zhang. Double projection algorithms for solving the split feasibility problems. Journal of Industrial & Management Optimization, 2019, 15 (4) : 2023-2034. doi: 10.3934/jimo.2018135 [9] Ai-Ling Yan, Gao-Yang Wang, Naihua Xiu. Robust solutions of split feasibility problem with uncertain linear operator. Journal of Industrial & Management Optimization, 2007, 3 (4) : 749-761. doi: 10.3934/jimo.2007.3.749 [10] Mohsen Tadi. A computational method for an inverse problem in a parabolic system. Discrete & Continuous Dynamical Systems - B, 2009, 12 (1) : 205-218. doi: 10.3934/dcdsb.2009.12.205 [11] Fang Zeng, Pablo Suarez, Jiguang Sun. A decomposition method for an interior inverse scattering problem. Inverse Problems & Imaging, 2013, 7 (1) : 291-303. doi: 10.3934/ipi.2013.7.291 [12] Xiaona Fan, Li Jiang, Mengsi Li. Homotopy method for solving generalized Nash equilibrium problem with equality and inequality constraints. Journal of Industrial & Management Optimization, 2019, 15 (4) : 1795-1807. doi: 10.3934/jimo.2018123 [13] Hassan Mohammad. A diagonal PRP-type projection method for convex constrained nonlinear monotone equations. Journal of Industrial & Management Optimization, 2021, 17 (1) : 101-116. doi: 10.3934/jimo.2019101 [14] Yulan Lu, Minghui Song, Mingzhu Liu. Convergence rate and stability of the split-step theta method for stochastic differential equations with piecewise continuous arguments. Discrete & Continuous Dynamical Systems - B, 2019, 24 (2) : 695-717. doi: 10.3934/dcdsb.2018203 [15] Gang Qian, Deren Han, Lingling Xu, Hai Yang. Solving nonadditive traffic assignment problems: A self-adaptive projection-auxiliary problem method for variational inequalities. Journal of Industrial & Management Optimization, 2013, 9 (1) : 255-274. doi: 10.3934/jimo.2013.9.255 [16] Deren Han, Zehui Jia, Yongzhong Song, David Z. W. Wang. An efficient projection method for nonlinear inverse problems with sparsity constraints. Inverse Problems & Imaging, 2016, 10 (3) : 689-709. doi: 10.3934/ipi.2016017 [17] Kim Knudsen, Matti Lassas, Jennifer L. Mueller, Samuli Siltanen. Regularized D-bar method for the inverse conductivity problem. Inverse Problems & Imaging, 2009, 3 (4) : 599-624. doi: 10.3934/ipi.2009.3.599 [18] Andreas Kirsch, Albert Ruiz. The Factorization Method for an inverse fluid-solid interaction scattering problem. Inverse Problems & Imaging, 2012, 6 (4) : 681-695. doi: 10.3934/ipi.2012.6.681 [19] Lekbir Afraites, Chorouk Masnaoui, Mourad Nachaoui. Shape optimization method for an inverse geometric source problem and stability at critical shape. Discrete & Continuous Dynamical Systems - S, 2021  doi: 10.3934/dcdss.2021006 [20] Bastian Gebauer, Nuutti Hyvönen. Factorization method and inclusions of mixed type in an inverse elliptic boundary value problem. Inverse Problems & Imaging, 2008, 2 (3) : 355-372. doi: 10.3934/ipi.2008.2.355

2020 Impact Factor: 1.801