Steepest-Descent Approach to Triple Hierarchical Constrained Optimization Problems

الملخص EN

We introduce and analyze a hybrid steepest-descent algorithm by combining Korpelevich’s extragradient method, the steepest-descent method, and the averaged mapping approach to the gradient-projection algorithm.

It is proven that under appropriate assumptions, the proposed algorithm converges strongly to the unique solution of a triple hierarchical constrained optimization problem (THCOP) over the common fixed point set of finitely many nonexpansive mappings, with constraints of finitely many generalized mixed equilibrium problems (GMEPs), finitely many variational inclusions, and a convex minimization problem (CMP) in a real Hilbert space.