The subproblem is solved by simulated annealing algorithm.
该子问题可通过模拟退火算法来解决。
Chapter 2: a trust region subproblem model with memory is proposed.
第二章：给出了带记忆的信赖域子问题模型。
Then with the analysis on the combination of each subproblem, a logic process for solving them is presented.
进一步分析了这两个问题的组合复杂性，提出了分层求解方案。
I had to define the task closure, determine appropriate task granularity, split the subproblem, combine the results, and so on.
我必须定义任务闭包、确定合适的任务粒度、分离子问题、综合结果，等等。
The process will often be self-repeating since each subproblem may still be complex enough to require further decomposition.
由于每个子问题可能仍然十分复杂，需要进一步的分解，这个过程就将不断的循环往复。
Note that the subproblem method does not copy the elements; it merely copies the array reference and offsets into an existing data structure.
注意subproblem方法没有复制这些元素；它只是将数组引用和偏移复制到一个现有的数据结构中。
In many practical problems it is proved that the coefficient of time complexity can be improved by balancing the size of the subproblem.
在很多具体问题上可证明子问题平衡对时问复杂性的常系数可以有改进。
In this algorithm, a subproblem is set up to search for a new feasible point at which the value of the objective function is lower than the current local minimum.
该算法通过构造子问题来寻找优于当前局部最优解的可行解。
At each iteration, the proposed subproblem consists of a strongly monotonic linear variational inequality and a well-conditioned system of nonlinear equations, which is easily to be solved.
在每步迭代计算中，新方法提出了易于计算的子问题，该子问题由强单调的线性变分不等式和良态的非线性方程系统构成。
At each iteration, a master direction is obtained by solving one direction finding subproblem which always possesses a solution, and an auxiliary direction is yielded by an explicit formula.
在每次迭代中，主方向是通过求解一个总有解的寻找方向子问题产生，而辅助方向是由一显式公式计算产生。
At each iteration, a master direction is obtained by solving one direction finding subproblem which always possesses a solution, and an auxiliary direction is yielded by an explicit formula.
在每次迭代中，主方向是通过求解一个总有解的寻找方向子问题产生，而辅助方向是由一显式公式计算产生。
应用推荐