An algorithm for approximating a common solution of variational inequality and convex minimization problems

Optimization ◽  
2020 ◽  
pp. 1-20
Author(s):  
Monday Ogudu Nnakwe
Keyword(s):  
Variational Inequality ◽  
Convex Minimization ◽  
Common Solution ◽  
Minimization Problems ◽  
Convex Minimization Problems

New iterative methods for equilibrium and constrained convex minimization problems

2019 ◽  
Vol 12 (03) ◽  
pp. 1950042 ◽  
Author(s):  
Maryam Yazdi
Keyword(s):  
Convex Minimization ◽  
Projection Algorithm ◽  
Averaged Mapping ◽  
Convex Minimization Problem ◽  
Constrained Convex Minimization ◽  
Common Solution ◽  
Minimization Problems ◽  
Convex Minimization Problems ◽  
Constrained Convex Minimization Problem ◽  
Implicit And Explicit

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.

scholarly journals Iterative algorithm for singularities of inclusion problems in Hadamard manifolds

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Parin Chaipunya ◽  
Konrawut Khammahawong ◽  
Poom Kumam
Keyword(s):  
Variational Inequality ◽  
Iterative Algorithm ◽  
Convex Minimization ◽  
Variational Inequality Problems ◽  
Hadamard Manifolds ◽  
Inclusion Problems ◽  
Numerical Example ◽  
Minimization Problems ◽  
Convex Minimization Problems

AbstractThe main purpose of this paper is to introduce a new iterative algorithm to solve inclusion problems in Hadamard manifolds. Moreover, applications to convex minimization problems and variational inequality problems are studied. A numerical example also is presented to support our main theorem.

scholarly journals A new iterative method for generalized equilibrium and constrained convex minimization problems

2020 ◽  
Vol 74 (2) ◽  
pp. 81
Author(s):  
M. Yazdi
Keyword(s):  
Convex Minimization ◽  
Projection Algorithm ◽  
Strong Convergence Theorem ◽  
Constrained Convex Minimization ◽  
Common Solution ◽  
Minimization Problems ◽  
Convex Minimization Problems ◽  
Constrained Convex Minimization Problem ◽  
Generalized Equilibrium ◽  
New Iterative Method

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.

scholarly journals A General Iterative Scheme Based on Regularization for Solving Equilibrium and Constrained Convex Minimization Problems

2013 ◽  
Vol 2013 ◽  
pp. 1-11
Author(s):  
Ming Tian
Keyword(s):  
Equilibrium Problem ◽  
Split Feasibility Problem ◽  
Convex Minimization ◽  
Feasibility Problem ◽  
Constrained Convex Minimization ◽  
Common Solution ◽  
Minimization Problems ◽  
Convex Minimization Problems ◽  
Implicit And Explicit ◽  
Split Feasibility

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.

Sign in / Sign up

Export Citation Format

Share Document