On solving of constrained convex minimize problem using gradient projection method (Q1728981): Difference between revisions

Summary: Let \(C\) and \(Q\) be closed convex subsets of real Hilbert spaces \(H_1\) and \(H_2\), respectively, and let \(g : C \longrightarrow \mathbb R\) be a strictly real-valued convex function such that the gradient \(\nabla g\) is an \(1/L\)-ism with a constant \(L>0\). In this paper, we introduce an iterative scheme using the gradient projection method, based on Mann's type approximation scheme for solving the constrained convex minimization problem (CCMP), that is, to find a minimizer \(q \in C\) of the function \(g\) over set \(C\). As an application, it has been shown that the problem (CCMP) reduces to the split feasibility problem (SFP) which is to find \(q \in C\) such that \(A q \in Q\) where \(A : H_1 \longrightarrow H_2\) is a linear bounded operator. We suggest and analyze this iterative scheme under some appropriate conditions imposed on the parameters such that another strong convergence theorems for the CCMP and the SFP are obtained. The results presented in this paper improve and extend the main results of \textit{M. Tian} and \textit{H.-F. Zhang} [J. Inequal. Appl. 2017, Paper No. 13, 12 p. (2017; Zbl 1357.58024)] and many others. The data availability for the proposed SFP is shown and the example of this problem is also shown through numerical results.