ABSTRACT

A convex quadratic programming problem with bound constraints is solved at first, using a Lagrange multiplier approach. Then a trust region method for non-linear optimization with box constraints is developed, where the trust region is a hyperbox, in contrast to the usual hyperellipsoid choice. The resulting subproblem is solved using our above mentioned QP technique.