英语释义

1. a problem that is contingent on or forms a part of another more inclusive problem

片语

SQP subproblemSQP子问题

layout optimal subproblem布局优化子问题

quadratic subproblem二次子问题

subproblem graph[计]

subproblem tree翻译

independent subproblem独立子问题

Quadratic programming subproblem二次规划子问题

sub-subproblem子子问题

barrier subproblem障碍子问题

英汉例句

• 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.

  在每步迭代计算中，新方法提出了易于计算的子问题，该子问题由强单调的线性变分不等式和良态的非线性方程系统构成。

• the variables in the linear subproblem are decoupled by a conjugate gradient method and the nonlinear one is treated as a quasilinear problem.

  线性问题用共轭梯度法解除压强-速度的耦合；非线性问题进行局部线化。

• then with the analysis on the combination of each subproblem , a logic process for solving them is presented.

  进一步分析了这两个问题的组合复杂性，提出了分层求解方案。

• chapter 2: a trust region subproblem model with memory is proposed.

  第二章：给出了带记忆的信赖域子问题模型。

• this paper mainly discusses the conic trust region subproblem which is a key problem in conic trust region method.

  在锥模型信赖域方法中，解锥模型信赖域子问题是关键，因此本文主要研究锥模型信赖域子问题及求解方法。

• subproblems are re-solved given their new objective functions. an optimal value for each subproblem is offered to the master program.

  建立已简化矩阵的可行解，公式化子问题的目标函数，子问题的解会改善主规划的目标；

• 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.

  在每次迭代中，主方向是通过求解一个总有解的寻找方向子问题产生，而辅助方向是由一显式公式计算产生。

• a finite element model is built using ansys, and the reasonable results are got by subproblem approximation method.

  然后在ansys上建立了有限元模型，采用子问题近似方法进行了动力响应优化求解，获得了合理的优化结果。

• the subproblem is solved by simulated annealing algorithm.

  该子问题可通过模拟退火算法来解决。

• the process will often be self-repeating since each subproblem may still be complex enough to require further decomposition.

  由于每个子问题可能仍然十分复杂，需要进一步的分解，这个过程就将不断的循环往复。

• 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.

  信赖域方法是解决无约束优化问题的一类有效的方法，而求解信赖域子问题又是信赖域方法的一个重要的组成部分。

• 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.

  该算法通过构造子问题来寻找优于当前局部最优解的可行解。