A general iterative algorithm for finding a common solution of equilibrium and constrained convex minimization problems

2013 ◽  
Vol 43 (4) ◽  
pp. 365-381
Author(s):  
Ming TIAN ◽  
Lei LIU
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.


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.


2013 ◽  
Vol 2013 ◽  
pp. 1-11
Author(s):  
Ming Tian

The present paper is divided into two parts. First, we introduce implicit and explicit iterative schemes based on the regularization for solving equilibrium and constrained convex minimization problems. We establish results on the strong convergence of the sequences generated by the proposed schemes to a common solution of minimization and equilibrium problem. Such a point is also a solution of a variational inequality. In the second part, as applications, we apply the algorithm to solve split feasibility problem and equilibrium problem.


2012 ◽  
Vol 2012 ◽  
pp. 1-14
Author(s):  
Ming Tian ◽  
Min-Min Li

It is well known that the gradient-projection algorithm (GPA) is very useful in solving constrained convex minimization problems. In this paper, we combine a general iterative method with the gradient-projection algorithm to propose a hybrid gradient-projection algorithm and prove that the sequence generated by the hybrid gradient-projection algorithm converges in norm to a minimizer of constrained convex minimization problems which solves a variational inequality.


Sign in / Sign up

Export Citation Format

Share Document