Hybrid Gradient-Projection Algorithm for Solving Constrained Convex Minimization Problems with Generalized Mixed Equilibrium Problems

الملخص EN

It is well known that the gradient-projection algorithm (GPA) for solving constrained convex minimization problems has been proven to have only weak convergence unless the underlying Hilbert space is finite dimensional.

In this paper, we introduce a new hybrid gradient-projection algorithm for solving constrained convex minimization problems with generalized mixed equilibrium problems in a real Hilbert space.

It is proven that three sequences generated by this algorithm converge strongly to the unique solution of some variational inequality, which is also a common element of the set of solutions of a constrained convex minimization problem, the set of solutions of a generalized mixed equilibrium problem, and the set of fixed points of a strict pseudocontraction in a real Hilbert space.