摘要
In this paper, we give a new generalized gradient projection algorithm for nonlinear optimization problems with arbitrary initial point. This new algorithm has some important advantages as follows: (1) The algorithm does not require initial feasible point; (2) It can deal with nonlinear equality and inequality constraints problems; (3) The structure of our algorithm is very simple;(4) Under some mild assumptions, it has global convergence.
In this paper, we give a new generalized gradient projection algorithm for nonlinear optimization problems with arbitrary initial point. This new algorithm has some important advantages as follows: (1) The algorithm does not require initial feasible point; (2) It can deal with nonlinear equality and inequality constraints problems; (3) The structure of our algorithm is very simple;(4) Under some mild assumptions, it has global convergence.
