Variant Gradient Projection Methods for the Minimization Problems

Abstract EN

The gradient projection algorithm plays an important role in solving constrained convex minimization problems.

In general, the gradient projection algorithm has only weak convergence in infinite-dimensional Hilbert spaces.

Recently, H.

K.

Xu (2011) provided two modified gradient projection algorithms which have strong convergence.

Motivated by Xu’s work, in the present paper, we suggest three more simpler variant gradient projection methods so that strong convergence is guaranteed.