子问题的英文

发音:

英文翻译
造句

subproblem

子 son
问题 question; problem
脖子问题 neck problems
独立子问题 independent subproblem
多电子问题 many electron problem
面子问题 a matter of face
亲-子问题 parent-child problem
绳子问题 strings problem
子问题树 subproblem tree
狐狸、鹅、豆子问题 fox, goose and bag of beans puzzle
太阳中微子问题 solar neutrino problem
关于二次子问题的解 on solution of quadratic subproblem
中国大陆孕妇到港产子问题 right of abode issue, hong kong
问题 1.(需回答的题目) question; problem 解答问题 solve a problem; 提问题 ask a question2.(需研究解决的矛盾等) problem; matter 问题的关键 the heart of the matter; key to the question; key to the solution of a question; 问题的实质 essence of the problem [question]; 问题成堆 a satchel [a batch] of questions; 难问题 a troublesome problem; 共同关心的问题 questions of common interest; 关键问题 a key problem; 思想问题 an ideological problem; 悬而未决的问题 an outstanding issue; 原则问题 a question of principle; a matter of principle; 枝节问题 minor issue3.(事故或意外) trouble; mishap; sth. wrong 解决麻烦问题的能手 trouble shooter; 没出什么问题 without any mishap; 那机器有点问题。 something is wrong with the machine.4.(重要之点) the point; the thing 问题不在这里。 that is not the point
97问题 transfer of the sovereignty of hong kong
成问题 be a problem; be open to quesiton (doubt; objection) 完成生产指标不成问题。 we will fulfil the quota without fail. 雨再不停, 明天的比赛就要成问题了。 if the rain doesn't stop, i doubt if we can have the game tomorrow. 在我国大学毕业生就业不成问题。 getting a job is no problem for college graduates in our country
出问题 go wrong
大问题 great problem; large problem
等问题 scheduling problem
反问题 indirect problem
分问题 component problem
怪问题 a catch question ie one intended to trick sb
混乱，问题 mix unoun
假问题 pseudo-problem
矩问题 moment problem; problem of moments; roblem

"查查词典"手机版

千万人都在用的超大词汇词典翻译APP

例句与用法

Meanwhile , we point out the privilege and defective of cim . the fourth chapter is the main body of this paper . we explore how to apply the cim to solve unconstrained optimization problems effectively
第四章是本文的主要部分，探讨了锥模型信赖域子问题的求解及不完全锥函数插值模型算法的数值实现。
The first aim of this work is to circumvent the two drawbacks just mentioned . three qp - free algorithms based on facchinei - fischer - kanzow kkt identification technique are proposed in the first chapter
在这种情况下便产生了对qp一free算法的研究，因为它的子问题只包含更易求解且计算量相对较小的线性系统。
The excellence and basic thinking of green function method is shown because forced harmonic oscillator is discussed , further more , that the green function method is used widely is clarified
最后，以普通物理中的受迫谐振子问题为例，突出体现了green函数方法的优点，并进一步说明了green函数方法应用的普遍性。
This paper presents a conjugate gradient method using restart strategy for solving trust region subproblems . and the convergence is proved . the numerical results show that this strategy is very effective
摘要给出了用共轭梯度法解信赖域子问题的重新开始策略，并证明了方法的收敛性，数值结果表明该策略可以大大提高算法的收敛速度。
The total number of subclassifiers in our new method linearly scales with the number of classes and the size of each subclassifier is smaller than that of the correspondent binary svm subclassifier used in the original method
此种构造方式使子分类器数目仅随类别数作线性增长，且子问题规模小于前一种方式中任一两类分类器的规模。
The theory is based on the same sticking point , which are the difference of the equilibrium structure when a molecule or a cation receive or lose a electron and the electronic factor of electron transfer
理论立足于电子转移的关键，即当一个分子或离子得到或失去一个电子时所发生的核平衡构型的变化动力学问题及决定电子转移的电子困子问题。
At first , on the basis of the sufficient and necessary optimality conditions , we give a certain algorithm to compute the trust region subproblem ; then , we draw out a different scheme for parameter vector in cim
在分析子问题最优性条件的基础上，我们给出了锥函数模型信赖域子问题的求解算法；并从数据拟合的角度提出了对锥模型中参数向量的另外一种选择方案。
We use a scaling matrix which make the algorithm generate sequences of point in trust region and the interior of the feasible set . because of the boundedness of the trust region , trust region algorithm can use non - convex approximate models
构造合理的仿射变换矩阵，在投影空间构造信赖域子问题，产生迭代方向，使迭代点既保持在信赖域内，又是严格可行域的内点。
It is posssible that the trust region subproblem needs to be resolved many times before obtaining an acceptable step for the traditional trust region method , and hence the total computation for completing one iteration might be expensive
对于传统的信赖域方法，要获得可接受的迭代步可能要通过重复计算多次信赖域子问题才能获得，因此每完成一次迭代的整个计算会比较大。
The objective function of the qp problem is a quadratic function which is an approximation of the lagrangian function of the constrained problem and the constraints of the qp problem are linear approximation of the constraints of the constrained problem
这些二次规划子问题的目标函数是原约束最优化问题的lagrange函数的二次某种近似，其约束条件是原约束最优化问题的线性逼近。