The subproblem is solved by simulated annealing algorithm 該子問題可通過模擬退火算法來解決。
On solution of quadratic subproblem 關(guān)于二次子問題的解
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陣正定,則它是一個(gè)嚴(yán)格凸二次規(guī)劃問題。
The process will often be self - repeating since each subproblem may still be complex enough to require further decomposition 由于每個(gè)子問題可能仍然十分復(fù)雜,需要進(jìn)一步的分解,這個(gè)過程就將不斷的循環(huán)往復(fù)