minimization problem发音

意思翻译

[数]最小化问题

相似词语短语

minimization───n.减到最小限度；估到最低额；轻视

problem───n.难题；引起麻烦的人；adj.成问题的；难处理的

address problem───地址问题

housing problem───住房问题；房屋问题

connection problem───[经]衔接问题

statistics problem───统计问题

atomicity problem───原子性问题

counteracting problem───反问题

dual problem───[数]对偶问题；成对问题，对偶问题

双语使用场景

The filled function method is an approach for solving unconstrained global minimization problem.───填充函数法是一种解无约束全局极小化问题的方法。

For example, a maximization problem can be rewritten as a minimization problem.───例如，最大化问题可以重写为一个最小化问题。

This is typically an energy minimization problem.───这是典型的能量最小化问题。

If the primal were a minimization problem, then the dual would be a maximization problem.───如果初始问题是一个最小化问题，那么其对偶问题就是一个最大化问题。

This suggest the formulation of the phase unwrapping problem as a minimization problem with integer variables.───这表明，制订该相位展开的问题，作为一个极小化问题与整数变数。

This paper presents a solution to the test time minimization problem for core- based systems .───本文针对基于芯核系统的测试时间最小化问题提出了一种解决方案。

A causal residual generator is obtained by making use of the ununiqueness of the optimal solutions to the minimization problem.───然后，利用该最小化问题解不唯一的特点，求得满足因果关系的最优残差产生器。

Filled Function Method for Unconstrained Global Minimization Problem───一个求无约束全局优化问题的填充函数算法

英语使用场景

In this paper, the author applies affine reduced operation to the model based secant method and gives a new method to look for the descent direction for solving unconstrained minimization problem.

A method to solve local minimization problem was described too. This method can lower system overhead.

It is known that the VIP can be reformulated as an unconstrained minimization problem through the D-gap function.

The active contour model is a linear constraint, so the main computation involved in the deformation is a solution of a linear energy minimization problem.

The Filled Function Method is an approach for solving unconstrained global minimization problem.

So long as this minimization problem is solved, the whole system is asymptotically stable.

This is typically an energy minimization problem.

Under new control conditions, we prove convergence of the quadratic minimization problem, which improves the recent results by Xu about quadratic optimization.

BLLPP is reduced to a parameter concave minimization problem, based on which, anincreasing feasible extreme point search algorithm is presented.