科研之友
微信
新浪微博
Facebook
分享链接
摘要
We introduce and analyze a hybrid steepest-descent algorithm by combining Korpelevich's extragradient method, the steepestdescent 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.
