Sentence examples for by minimizing the problem from inspiring English sources

By minimizing the problem for six to seven weeks, Mr. Stamos said that RSA made companies more vulnerable.

One is derived by minimizing the problem of emissions (PE).

One is derived by minimizing the problem of cost (PC).

Another is derived by minimizing the problem of emission (PE), along with its relevant cost.

Another is derived by minimizing the problem of cost (PC), along with its relevant emissions.

Layer 2: obtain λ n by minimizing the Lagrange problem. 1) Solution for layer 1: By dual decomposition, we first solve the following Layer 1 sub-problem: mathop {max }limits_{p_{k,n}^{m,v} ge 0} {kern 1pt} {kern 1pt} Lleft(p_{k,n}^{m,v},{lambda_{n}}right) (20).

These experimental conditions will maximize the Pt-catalyst utilization by minimizing the accessibility problems of the reactant into the inner part of the electrodes.

This set of technologies and knowledge sources was designed to be used by a variety of applications, minimizing the problem of different ways into which a concept can be expressed on biomedical information sources [ 40].

Secondly, update u j + 1 by minimizing the differentiable optimization problem in the following: underset{u}{ min}left{{displaystyle sum_{varOmega}left[{leftVert s-{l}^i- urightVert}^2+beta {left[ exp u -0.5right]}^2+lambda {lexp u -0.5right1}-nabla u-{b}_1^jrightVert}^2right]}^2+lambda20).

Secondly, update w j + 1 by minimizing the differentiable optimization problem in the following: underset{w}{ min}left{{displaystyle sum_{varOmega}left[{leftVert s-{r}^{i+1}- wrightVert}^2+gamma {leftVert {t}^{j+1}-nabla w-{b}_2^jrightVert}^2right]}right}, (28).

If we set f ( x ) : = 1 2 ∥ A x − P Q A x ∥ 2, then the convex objective f is differentiable and has a Lipschitz gradient given by ∇ f ( x ) = A ∗ ( I − P Q ) A. Thus, the CQ algorithm (2) can be obtained by minimizing the following convex minimization problem min x ∈ C f ( x ).