subproblem
英
美
网络 子问题
复数：subproblems
双语例句
- That is, each cell will contain a solution to a subproblem of the original problem.
也就是说，每个单元格包含原始问题的一个字问题的解。 - I had to define the task closure, determine appropriate task granularity, split the subproblem, combine the results, and so on.
我必须定义任务闭包、确定合适的任务粒度、分离子问题、综合结果，等等。 - The subproblem is solved by simulated annealing algorithm.
该子问题可通过模拟退火算法来解决。 - By using active set strategy, the authors need only to solve a reduced trust region subproblem which is solved inexactly by the truncated conjugate gradient method.
作者利用有效集策略，在每次迭代中只需求解一个低维的信赖域子问题，该信赖域子问题是通过截断共轭梯度法来近似求解的。 - 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.
利用这个极大极小问题及子问题中各函数的方向可微性给出了子问题的一阶最优性条件。 - Because HAR system provides the function of three-level description and hypothesis-based association, the representation of domain knowledge can be combined closely with the inference control for using the knowledge so as to realize the functional representation of subproblem solving.
HAR系统提供了三级描述和假设联想功能，把领域知识的表达和运用知识的推理控制策略紧密地结合在一起，实现对子问题求解的功能化表达。 - The layout problem is partitioned into finite subproblems by using graph theory, the action of group on set, orbits and so on, such that each subproblem overcomes its on-off nature about optimal variable.
应用图论、群对集合的作用、轨道等，把该问题分解为有限多个子问题，在每个子问题中克服了关于优化变量的时断时续性质。 - Chapter 3: Using spectral projected gradient method and a new nonmonotone line search technique, we propose a algorithm for solving the trust region subproblem. Under weak conditions, the global convergence is established.
第三章：利用谱投影梯度方法与一个新的非单调线搜索技术给出了求解信赖域子问题的一个方法，在一般的假设条件下获得了方法的全局收敛性。 - For each subproblem, the Lagrangian decomposition is used to produce an upper bound of the objective function together with a feasible solution and an infeasible solution.
利用拉格朗日分解方法可以得到每个子问题的一个可行解，一个不可行解，一个下界和一个上界。 - At every iteration the algorithm solves only one quadratic subproblem.
在每次迭代，只需解一个二次规划子问题； - A study is made of the routing subproblem in this paper, and the algorithm is evaluated in simulations by the mathematical software Matlab.
本文主要研究WDM光网络中的路由问题，并利用数学软件Matlab进行仿真，对算法性能加以评价。 - The aim of this paper is to construct a three-term conjugate gradient method to solve the trust region subproblem.
在本文中，我们提出了解信赖域子问题的三项预处理共轭梯度法，并将这个方法嵌入解大型最优化问题的信赖域算法中。 - And then, a dual quadratic programming ( DQP) subproblem is generated.
二次规划（QP）子问题又可以转化成对偶二次规划（DQP）子问题。 - Three-Term Preconditioned Conjugate Gradient Method and Trust Region Subproblem
三项预处理共轭梯度法与信赖域子问题 - This paper presents the "Backward Mixed-Integer programming Method" addressing the latter subproblem.
本文提出“后向混合整数规划法”求解动态决策问题。 - According to this method, the optimization problem is decomposed into an investment subproblem and an operation subproblem, and the solution is determined by iterative procedure between both problems.
根据该方法，以年费用最小为目标函数，将优化问题分解为投资主问题与运行子问题，并在两个问题间迭代求解。 - Aimed to solve the nonlinear subproblem, an nonlinear optimization algorithm is used.
针对非线性子问题，提出了采用非线性优化算法来进行反演。 - The optimization algorithm for the relaxed subproblem is constructed by virtue of the optimality function and the convergence is proved.
利用最优性函数构造了松弛子问题的优化算法，并证明了算法的收敛性。 - Automatic contingency selection and ranking using an unified model and algorithm for P-and Q-subproblem
按有功和无功指标自动故障选择和排序的统一模型和统一算法 - LPC-RVL algorithm divides RWA problem into routing subproblem and wavelength assignment subproblem.
LPC-RVL算法把RWA问题分成路由和波长分配两个子问题分别解决。 - The two most important algorithm framework to optimization problem are line search method and trust region method, one of the key constitute parts of them are search direction and trust region subproblem respectively, the other are naturally the framework themselves.
线搜索方法和信赖域方法是解最优化问题的两类最基本的算法框架，求解线搜索方向和信赖域子问题分别是其关键的组成部分之一，另一个关键点自然就是框架本身了。 - The subproblem was transformed to a linear programming and a one-dimension constrained optimization problem.
对每个子问题求解时引入一组共轭方向，将子问题可以转化为一个线性规划问题和一个一维约束优化问题。 - The overlapping calculation subproblem in the iterative algorithm is introduced to automatically determine the overlapping correspondence for the basic algorithm. Ball constraints are imposed on the optimization variables to guarantee the local validity of linearization, which is important for correct stitching.
利用迭代算法中重叠计算子问题的求解方法来自动确定基本算法中的重叠对应关系，并对优化变量引入球约束，以保证基本算法中线性近似的局部有效性，实现正确拼接。 - The algorithm uses available gradient and function information, and makes sure that the Hessian matrix of trust region subproblem is positive-definite.
算法同时利用了迭代过程所得到的函数值信息和相应的梯度信息，还保持了信赖域子问题的海森矩阵的正定性。 - Moreover, an algorithm combined with line-search technique is proposed. The new algorithm reduces times in solving subproblem at each update, and improves the efficiency of numerical calculation.
而后又提出一个将该算法结合线性搜索技术的新算法，使每次迭代时，减少了求解子问题的次数，提高了数值计算效率。 - According to optimization model, main problem and subproblem based on Benders decomposition and its corresponding model are established to realize the simplified constraints.
基于Benders分解的主问题和子问题及其相应的模型，相对于原问题，实现了多约束的简化。 - The VRP is formulated as a mix-integer programming model with the objective to minimize the total traveling distance. By using the Danzig-Wolfe decomposition, this model is transformed into a set partitioning ( SP) model and a pricing subproblem model.
本文介绍了VRP的精确算法，给出了一个以行驶距离最小为目标的混合整数规划模型，通过Danzig-wolfe分解，把该模型转化成了集合划分（SP）模型和子问题模型。 - According to the feature of the problem, the SP model and the subproblem model are proposed.
根据该问题的特点，建立了SP模型和子问题模型。 - As to SCS, the existence of the solution is proved and a greedy algorithm is proposed to solve this subproblem.
对族中扰码挑选子问题，证明了挑选方案的存在性，并提出了一种贪婪算法进行求解。 - The Lagrangian relaxation algorithm is designed to solve the scheduling subproblem during each rolling window.
对应于滚动时域的每个窗口的调度子问题，设计了拉格朗日松弛算法进行近似求解。