Sentence examples for minimizes i from inspiring English sources

end{aligned} Then FBVP (1.1) has at least one weak solution that minimizes I on (E_{0}^{alpha,p}).

Since β, Z, and exp ( - β I are positive, the path γ that minimizes I gives the maximum p.

If there exist another τ = τ * < τ* that locally maximizes ( frac{mathrm{d}{I}_{tau }}{mathrm{d}tau } ), then there has to exist ( tilde{tau} ) with ( {tau}_minimizes I τ because of its continuity and smoothness.

Theorem 3.1 If lim sup | t | → ∞ p ( k ) F ( k, t ) | t | p ( k ) < λ 1, k ∈ [ 1, T ], (3.2). then problem (1.1), (1.2) has at least one solution which minimizes I on X. Proof By the continuity of Φ and the lower semicontinuity of ψ, we have that the functional I is sequentially l.s.c. on X.

For this reason, it is proposed to choose n to minimize I n.

It is noted that the influence of interference due to the term I n can readily be minimized independently by minimizing I n.

The framework addresses the tradeoff between minimizing (i) the state of charge (SOC) imbalance between battery cells and (ii) the energy dissipated by balancing.

A necessary condition for a and φ to give the slowest varying representation, in the sense of minimizing I in (18), is given as (19).

Unlike the control schemes presented in [17], a new circulating current optimization method is proposed as follows to minimize I cir.

This paper proposes two optimization algorithms for the RS-γ charts, i.e. by minimizing (i) the average run length (ARL) for a deterministic shift size and (ii) the expected ARL over a process shift domain.

For optimum implementation, this paper develops two optimal design strategies for the synthetic t chart with estimated process mean, by minimizing (i) the average run length (ARL) and (ii) the expected ARL, for deterministic and unknown shift sizes, respectively.