On solving of constrained convex minimize problem using gradient projection method
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.
- A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem
- Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
- A note on the multiple-set split convex feasibility problem in Hilbert space
- A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces
- A general approximation method for a kind of convex optimization problems in Hilbert spaces
- A hybrid approximation method for equilibrium and fixed point problems for a monotone mapping and a nonexpansive mapping
- A multiprojection algorithm using Bregman projections in a product space
- A new hybrid iterative method for solution of equilibrium problems and fixed point problems for an inverse strongly monotone operator and a nonexpansive mapping
- A regularized gradient projection method for the minimization problem
- A strong convergence theorem for equilibrium problems and split feasibility problems in Hilbert spaces
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- An alternating projection that does not converge in norm
- An iterative algorithm for fixed point problem and convex minimization problem with applications
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Averaged mappings and the gradient-projection algorithm
- Extragradient-projection method for solving constrained convex minimization problems
- Gradient projection method with a new step size for the split feasibility problem
- scientific article; zbMATH DE number 5154870 (Why is no real title available?)
- scientific article; zbMATH DE number 6921240 (Why is no real title available?)
- scientific article; zbMATH DE number 3293978 (Why is no real title available?)
- scientific article; zbMATH DE number 7696364 (Why is no real title available?)
- Introduction to nonlinear and convex analysis
- Iterative methods for finding minimum-norm fixed points of nonexpansive mappings with applications
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Perturbation techniques for nonexpansive mappings with applications
- Projected gradient methods for linearly constrained problems
- Projection and contraction methods for constrained convex minimization problem and the zero points of maximal monotone operator
- Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
- Strong convergence of composite iterative methods for equilibrium problems and fixed point problems
- Strong convergence of iterative methods for \(k\)-strictly pseudo-contractive mappings in Hilbert spaces
- Strong convergence theorems by hybrid methods for families of nonexpansive mappings in Hilbert spaces
- Variant gradient projection methods for the minimization problems
- Viscosity approximation methods for nonexpansive mappings
- A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem
- The zeros of monotone operators for the variational inclusion problem in Hilbert spaces
- A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces
- Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
- A note on the multiple-set split convex feasibility problem in Hilbert space
This page was built for publication: On solving of constrained convex minimize problem using gradient projection method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1728981)
