minimization problem的意思

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.