scholarly journals A Common Solution of Equilibrium, Constrained Convex Minimization, and Fixed Point Problems

2021 ◽  
Vol 52 ◽  
Author(s):  
Maryam Yazdi

In this paper, we propose a new iterative scheme with the help of the gradient- projection algorithm (GPA) for finding a common solution of an equilibrium problem, a constrained convex minimization problem, and a fixed point problem. Then, we prove some strong convergence theorems which improve and extend some recent results. Moreover, we give a numerical result to show the validity of our main theorem.

2019 ◽  
Vol 12 (03) ◽  
pp. 1950042 ◽  
Author(s):  
Maryam Yazdi

The gradient-projection algorithm (GPA) plays an important role in solving constrained convex minimization problems. In this paper, we combine the GPA and averaged mapping approach to propose implicit and explicit composite iterative schemes for finding a common solution of an equilibrium problem and a constrained convex minimization problem. Then, we prove some strong convergence theorems which improve and extend some recent results.


2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
M. Dilshad ◽  
A. F. Aljohani ◽  
M. Akram

This article is aimed at introducing an iterative scheme to approximate the common solution of split variational inclusion and a fixed-point problem of a finite collection of nonexpansive mappings. It is proven that under some suitable assumptions, the sequences achieved by the proposed iterative scheme converge strongly to a common element of the solution sets of these problems. Some consequences of the main theorem are also given. Finally, the convergence analysis of the sequences achieved from the iterative scheme is illustrated with the help of a numerical example.


Author(s):  
M. Yazdi

The gradient-projection algorithm (GPA) plays an important role in solving constrained convex minimization problems. In this paper, we combine the GPA and averaged mapping approach to propose an explicit composite iterative scheme for finding a common solution of a generalized equilibrium problem and a constrained convex minimization problem. Then, we prove a strong convergence theorem which improves and extends some recent results.


Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1161
Author(s):  
Jinhua Zhu ◽  
Jinfang Tang ◽  
Shih-sen Chang ◽  
Min Liu ◽  
Liangcai Zhao

In this paper, we introduce an iterative algorithm for finding a common solution of a finite family of the equilibrium problems, quasi-variational inclusion problems and fixed point problem on Hadamard manifolds. Under suitable conditions, some strong convergence theorems are proved. Our results extend some recent results in literature.


2018 ◽  
Vol 34 (3) ◽  
pp. 441-447
Author(s):  
ZI-MING WANG ◽  
◽  
AIRONG WEI ◽  
POOM KUMAM ◽  
◽  
...  

The purpose of this article is to investigate a projection algorithm for solving a fixed point problem of a closed multi-valued Bregman quasi-strict pseudocontraction and an equilibrium problem of a bifunction. Strong convergence of the projection algorithm is obtained without any compact assumption in a reflexive Banach space. As applications, monotone variational inequality problems are considered. Finally, a numerical simulation example is presented for demonstrating the feasibility and convergence of the algorithm proposed in main result.


Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 187
Author(s):  
Lu-Chuan Ceng ◽  
Qing Yuan

In this paper, we introduce a multiple hybrid implicit iteration method for finding a solution for a monotone variational inequality with a variational inequality constraint over the common solution set of a general system of variational inequalities, and a common fixed point problem of a countable family of uniformly Lipschitzian pseudocontractive mappings and an asymptotically nonexpansive mapping in Hilbert spaces. Strong convergence of the proposed method to the unique solution of the problem is established under some suitable assumptions.


Sign in / Sign up

Export Citation Format

Share Document