We present a new algarithm for soling nonlinear programming subject to nonlinear equality constraints with simple bounds in this paper

by use of the generalized reduced gradient restortion and feasible restoration.Simutaneously we prove a large scope convergence of the algorithm.Morever the initial point is not necessary feasible.but it satiffies bounded constaints in our algorithm.