subproblem

subproblem

1. Subproblem 1: How could multiple interacting parts emerge?

:次级问题1：彼此互动的多个部分怎麽可能浮现？

2. Subproblem 2: Could design emerge at all without a designer?

:次级问题2：没有设计者，有什麽设计可能浮现？

3. SQP subproblem

SQP子问题

4. Three-Term Preconditioned Conjugate Gradient Method and Trust Region Subproblem

三项预处理共轭梯度法与信赖域子问题

5. quadratic subproblem

二次子问题

6. When head-dependent power output is considered, the hydro subproblem no longer becomes unit-wise and stage-wise decomposable, and therefore becomes more difficult to solve systematically.

从而无需离散化任何连续变量就可以有效得到梯级水电系统的 高精度次优解。

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

作者利用有效集策略，在每次迭代中只需求解一个低维的信赖域子问题，该信赖域子问题是通过截断共轭梯度法来近似求解的。

8. trust region subproblem

信赖域子问题

9. On solution of quadratic subproblem

关于二次子问题的解

10. And how to solve the subproblem is the critical part of this method.

其中信赖域子问题的求解是关键的一部分。

11. The optimization algorithm for the relaxed subproblem is constructed by virtue of the optimality function and the convergence is proved.

利用最优性函数构造了松弛子问题的优化算法，并证明了算法的收敛性。

12. A high-order correction direction can be obtained by solving another quadratic subproblem with only equality constraints.

同时，高阶修正方向通过解一个仅含等式约束二次子规划来获得。

13. The aim of this paper is to construct a three-term conjugate gradient method to solve the trust region subproblem.

在本文中，我们提出了解信赖域子问题的三项预处理共轭梯度法，并将这个方法嵌入解大型最优化问题的信赖域算法中。

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

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

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

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

16. The convergence theorem of the proposed method is proved based on the exact solution of the subproblem.

基于子问题的精确求解，该文证明了算法的收敛性。

17. Layout Optimal Subproblem Based on an Improved Genetic Algorithm

基于改进遗传算法的布局优化子问题

18. Based on the active strategy, an iterative method is presented for the reformulated SIP problem, in which the number of inequality constraints in the subproblem is reduced.

基于有效集策略设计了转换后SIP问题的迭代法，该方法减少了子问题中不等式约束的个数。

19. subproblem graph

子问题图

20. subproblem tree

子问题树

21. Compath subproblem is solved by a dynamic programming algorithm derived from finding a shortest path in an acyclic graph.

子问题的求解用到了多情景下的寻找最短路方法；

22. It takes line search instead of resolving the subproblem to get the new trial step and the next iteration point when the trial step is not successful.It allows a considerable computational saving.

当试探步不成功时，并不重解子问题，而是利用非单调线搜索得到试探步及下一迭代点，有效地减少了计算量。

23. An alternative method can be applied to overcome this serious issue: only one subproblem is solved in low level and updating multipliers in high level immediately.

我们采用所谓的序贯子问题求解法（Successive Subproblem Solving）：在底层，每次只求解一个子问题，而保持其它子问题的解固定。

24. The current sequential quadratic programming (SQP) type algorithm may fail if the QP subproblem is infeasible.

摘要序列二次规划方法(SQP)是解决非线性规划问题最有效的算法之一，但是当QP子问题不可行时算法可能会失败。

25. Even in the LR framework, the hydro subproblem with cascaded reservoirs and discrete hydro constraints is still NP complete and therefore is difficult to solve mathematically.

文中提出了将这种方法应用于电力系统优化调度问题（具有离散区间的混合整数规划问题）的方法。

26. The method not only avoids resolving the subproblem repeatedly but also reduces the numbers of computing function values in the line search algorithm.

既避免了重复求解信赖域子问题，又减少了线搜索方法计算函数值的次数。

27. This method is so-called the Successive Subproblem Solving (SSS).

本文对于提出的算法，证明了算法的收敛性。

28. In each decomposed subproblem, only parameters in projected state space related to its subgoal are reserved, and identical subproblems are integrated into one through features comparison.

每个子问题保留与解决该子目标相关的参数，再透过特徵比对方式将相同子问题合并。

29. By the Interior Technique Solving the Trust Region Subproblem of the Variational Inequlity Problems with the Nonnegative Constrained Reformulation Form

求解一类变分不等式问题的内点信赖域方法

30. independent subproblem

独立子问题

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

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

32. 2004 year, ticket subproblem of the Chinese becomes suddenly serious rise.

票子:升值还是贬值？2004年,中国人的票子问题忽然变得严重起来。

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

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

34. While for the STI approach we construct a two-dimensional subspace and then solve the trust region subproblem on it directly.

而STI方法在构造的低维子空间上求信赖域子问题的解。

35. A New Algorithm for Solving Large Scale Trust Region Subproblem

解决大规模信赖域子问题的一种新算法

36. The subproblem is solved by simulated annealing algorithm.

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

37. Furthermore, the authors develop the proposed alternating direction method as an inexact method, which only needs to solve the subproblem inexactly.

进一步，又提出了一类非精确交替方向法，每步迭代计算只需非精确求解子问题。

38. And through the transformation, the conic trust region subproblem is converted into the problem of minimizing a quadratic function with two convex constraints.

通过对第二种情形进行细化和变换,把原锥信赖域子问题转化为凸规划问题。

39. In view of the face subproblem of tree article, they studied special " cure " plan.

鉴于树文的面子问题，他们研究了一套特别的“治疗”方案。

40. Subproblem approximation optimization

零阶近似优化