A supermemory gradient projection algorithm for optimization problem with nonlinear constraints

In this paper, by extending concept of the supermemory gradient method for unconstrained optimization problems, we present a supermemory gradient projection algorithm for nonlinear programming with nonlinear constraints. Under some suitable conditions we prove its global convergence.