A globally convergent algorithm based on the stabilized sequential quadratic programming (sSQP) method is presented in order to solve optimization problems with equality constraints and bounds. This formulation has attractive features in the sense that constraint qualifications are not needed at...

In this paper, a new trust region method is presented for general constrained optimization problem. In this algorithm, the trial step is obtained by solving two quadratic programming problems with bound constraints. The algorithm is implementable easily. Then we prove that the method is globally...