subproblem

However, the traditional trust region subproblem may meet difficulty. The Hessian matrix of the trust region subproblem may not be positive definite. In this case, the convergence rate of some trust region methods is only linear.

但传统的信赖域算法存在如下弱点：当信赖域子问题的海森矩阵不正定时，数值计算上存在一定困难，此时有些算法只具有线性收敛速度。

The current sequential quadratic programming ( SQP ) type algorithm may fail if the QP subproblem is infeasible.

序列二次规划方法 ( SQP ) 是解决非线性规划问题最有效的算法之一,但是当QP子问题不可行时算法可能会失败.

The subproblem is solved by simulated annealing algorithm.

该子问题可通过模拟退火算法来解决.