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 由于每個子問題可能仍然十分復雜,需要進一步的分解,這個過程就將不斷的循環往復
The method incorporates a primal partitioning scheme - with a network flow subproblem - to obtain good feasible solutions 本文設計了一種模擬退火算法的實現形式,通過大量的算例分析表明,該算法具有良好的尋優特性與運算效率。
Furthermore , the authors develop the proposed alternating direction method as an inexact method , which only needs to solve the subproblem inexactly 進一步,又提出了一類非精確交替方向法,每步迭代計算只需非精確求解子問題。
The aim of this paper is to construct a three - term conjugate gradient method to solve the trust region subproblem 在本文中,我們提出了解信賴域子問題的三項預處理共軛梯度法,并將這個方法嵌入解大型最優化問題的信賴域算法中。
In this new dividing strategy , the sum of the subproblem ' s scales is equal to the original problem ' s scale minus 1 . an eigenvalue interlacing theorem is given and proved 在這個劃分策略中,子問題的規模之和等于原問題的規模減1 ,文中給出了特征值分割定理及其證明。
Based on double dogleg path , the iterative direction is always obtained in the intersection of double dogleg path and bound of trust region by solving the affine scaling trust region subproblem 一般地,基于雙折線路徑方法可以在雙折線路徑和信賴域邊界相交點得到迭代步。