问题 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
成问题 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
In an sqp method , it is important to keep the hessian of the objective function in qp problem to be positive definite 在sqp算法中,保证qp子问题的目标函数的hessian阵的正定性是非常重要的。
There have developed some technique to ensure the positive definiteness of the hessian of the quadratic objective function 迄今为止,已提出了多种保证子问题的目标函数的hessian阵的正定性的方案。
Fourthly , multi - parameter control methods , super - memory gradient methods for solving sub - unconstrained optimization problems are investigated 四是提出多参数控制算法和求解子问题的超记忆梯度算法。
To deal with dependent problems with epistatic interactions , experimental study of cga for nk landscape problem is given 对于不可作独立子问题分解的问题,则以基因连锁一般模型? nk模型进行了实例研究。
The process will often be self - repeating since each subproblem may still be complex enough to require further decomposition 由于每个子问题可能仍然十分复杂,需要进一步的分解,这个过程就将不断的循环往复
The basic idea of an sqp method is to approximate the constrained problem by a sequence of quadratic programming ( qp ) problems Sqp算法的基本思想是通过求解一系列二次规划( qp )子问题来求解原最优化问题
2 . using the property of the bilinear and trilinear form , a priori bound for solutions of a weak formulation is given 利用双线性函数和三线性函数的性质,论述了各子问题的有界性、强制性以及解的先验估计。
Mathematics learning difficulty this thesis inquires into belongs to learning difficulty and increasingly draws people ' s attention 数学学习困难学生(简称数困生)问题作为学困生问题的子问题也越来越引起了大家的广泛关注。
In the end , we discuss the promising perspective and the problems in dealing with the polaronic question in complex quantum well 最后,我们论述了feynman路径积分方法在处理复杂量子阱中极化子问题时的前景和可能遇到的问题。
Furthermore , the authors develop the proposed alternating direction method as an inexact method , which only needs to solve the subproblem inexactly 进一步,又提出了一类非精确交替方向法,每步迭代计算只需非精确求解子问题。