A class of functions and a sort of nonlinear programming called respectively E-convex functions and E-convex programming were presented and studied recently by Youness in [1], In this paper, we point out the most results for .E-convex functions and E-convex programming in [1] are not true by six counter examples.
In this paper,by combining the trust region technique with the generalized gradient projection.a new trust region algorithm with feasible iteration points is presented for nonlinear inequality constrained optimization,and its trust region is a general compact set containing the origion as an inteior point.No penalty function is used in the algorithm,and it is feasible descent .Under suitable assumptions,the algorithm is proved to possess global and strong convergence as well as superlinear and quadratic convergence.Some numerical results are reported.
