The subproblem is solved by simulated annealing algorithm 该子问题可通过模拟退火算法来解决。
On solution of quadratic subproblem 关于二次子问题的解
The convergence theorem of the proposed method is proved based on the exact solution of the subproblem 基于子问题的精确求解,该文证明了算法的收敛性。
When the hessian is positive definite , the qp subproblem is a strict convex quadratic programming 若qp子问题的hessian阵正定,则它是一个严格凸二次规划问题。
The process will often be self - repeating since each subproblem may still be complex enough to require further decomposition 由于每个子问题可能仍然十分复杂,需要进一步的分解,这个过程就将不断的循环往复