| 释义 |
subproblem 英'sʌbprɒbləm美'sʌbprɒbləm COCA³¹⁵¹¹¹⁺⁴BNC¹⁴⁴⁶⁶⁴⁺³
基本例句
n.小问题²⁰子问题;部分问题⁶⁰;次要问题²⁰
At first, on the basis of the sufficient and necessary optimality conditions, we give a certain algorithm to compute the trust region subproblem;
在分析子问题最优性条件的基础上，我们给出了锥函数模型信赖域子问题的求解算法； cnki
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.
在每次迭代中，主方向是通过求解一个总有解的寻找方向子问题产生，而辅助方向是由一显式公式计算产生。 cnki
By using the generalized elimination method, the subproblem is equivalent to an unconstrained optimization problem in the null space.
基于广义消去法，本文中原问题可转化为等式约束矩阵的零空间中的一个无约束优化问题。 cnki
By using L1 exact penalty function as the merit function and solving a trust region subproblem, we prove that the trust region trial step provide a descent direction for the merit function.
通过求解某一信赖域子问题及对罚因子的矫正，证明了信赖域步为价值函数提供了一个下降方向。 cnki
By virtue of this minimax problem as well as the directionally differentiable property of the functions in every subproblem, the first-order optimality conditions are obtained.
利用这个极大极小问题及子问题中各函数的方向可微性给出了子问题的一阶最优性条件。 cnki
Chapter2: A trust region subproblem model with memory is proposed.
第二章：给出了带记忆的信赖域子问题模型。 cnki
I had to define the task closure, determine appropriate task granularity, split the subproblem, combine the results, and so on.
我必须定义任务闭包、确定合适的任务粒度、分离子问题、综合结果，等等。 ibm
In each- subproblem, high-dimensional state variable is used to denote the information of random travel times, and approximations of the value function are used to sol.
在每个子问题中，利用高维状态变量表示随机行驶时间信息，并采用价值函数的近似进行求解。 dictall
In many practical problems it is proved that the coefficient of time complexity can be improved by balancing the size of the subproblem.
在很多具体问题上可证明子问题平衡对时问复杂性的常系数可以有改进。 usstjournal-ss
Solving trust region subproblem is an important component of the algorithm based on trust region method, which has been shown to be very effective for unconstrained optimization problems.
信赖域方法是解决无约束优化问题的一类有效的方法，而求解信赖域子问题又是信赖域方法的一个重要的组成部分。 dictall
That is, each cell will contain a solution to a subproblem of the original problem.
也就是说，每个单元格包含原始问题的一个字问题的解。 ibm
The aim of this paper is to construct a three-term conjugate gradient method to solve the trust region subproblem.
在本文中，我们提出了解信赖域子问题的三项预处理共轭梯度法，并将这个方法嵌入解大型最优化问题的信赖域算法中。 http://dj.iciba.com
The subproblem is solved by simulated annealing algorithm.
该子问题可通过模拟退火算法来解决。 dictall
This paper mainly discusses the conic trust region subproblem which is a key problem in conic trust region method.
在锥模型信赖域方法中，解锥模型信赖域子问题是关键，因此本文主要研究锥模型信赖域子问题及求解方法。 cnki
This paper presents the “ Backward Mixed- Integer programming Method” addressing the latter subproblem.
本文提出“后向混合整数规划法”求解动态决策问题。 cnki |