Abstract: | A family of supermemory gradient projection methods for solving the convex constrained optimization problem is presented in this article. It is proven to have stronger convergence properties than the traditional gradient projection method. In particular, it is shown to be globally convergent if the objective function is convex. |