Examples of using Minimization problem in English and their translations into French
{-}
-
Official
-
Colloquial
The minimization problem becomes.
A similar argument works for a minimization problem.
Minimization problem as follows.
Planning: bound for the tardiness minimization problem.
The minimization problem becomes.
The γ solution to the minimization problem(20.70) is.
This minimization problem can be solved explicitly using a Lagrangian.
After that quantization becomes a minimization problem.
Then the minimization problem becomes.
This problem is formulated as a minimization problem.
For a minimization problem, Rh(d)≥ 1.
The problem is then reduced to an energy minimization problem.
The minimization problem is solved with the algorithm of Marquardt-Levenberg.
Consider the above problem as a minimization problem.
And the solution to the minimization problem is given by Wienerʼs formula: EPMATHMARKEREP.
This problem can be formulated as a minimization problem.
The reduced size of the minimization problem is solved by direct or iterative methods.
This problem is formulated as an error minimization problem.
The proposed constrained minimization problem is solved by using an augmented Lagrangian approach.
And we want to solve this problem as a minimization problem.
The initial non-linear minimization problem is replaced by a succession of linear problems. .
We show that these algorithms converge to solutions of some minimization problems.
Consider the period t cost minimization problem defined by equation(17.1.
This problem can be solved as a series of unconstrained minimization problems.
The Schrödinger problem is an entropy minimization problem with marginal constraints and a fixed reference process.
We study the completion problem of the low rank Hankel matrix as a minimization problem.
The CBP is a natural extension of the bandwidth minimization problem(BMP) and the MinLA is a min-sum problem. .
Abstract: This Thesis focuses on the study of inertial methods for solving composite convex minimization problems.
The solution to the period 1 cost minimization problem is the vector q1.
Let pt andPt be the prices for one unit of X and Z respectively in period t. The consumer's period t expenditure minimization problem may be defined as follows.