Abstract: In this article, a modified gradient-projection algorithm (GPA) is introduced, which combines Xu’s idea of an alternative averaged mapping approach to the GPA and the general iterative method for nonexpansive mappings in Hilbert space introduced by Marino and Xu. Under suitable conditions, it is proved that the strong convergence of the sequences generated by implicit and explicit schemes to a solution of a constrained convex minimization problem which also solves a certain variational inequality. Obtained results extend and improve some existed results.
DOI: *As the DOI is a unique identifier, it is already available in the pdf version. **The DOI link will be activated in the first midst of January 2026.
Ming Tian, Lihua Huang, "Strong Convergence of Modified Gradient-Projection Algorithm for Constrained Convex Minimization Problems," WSEAS Transactions on Mathematics, vol. 12, pp. -, 2013, DOI:
Ming Tian, Lihua Huang. Strong Convergence of Modified Gradient-Projection Algorithm for Constrained Convex Minimization Problems.
WSEAS Transactions on Mathematics. 2013;12:-.