Sentence examples for minimizing a constraint from inspiring English sources

The HNGPS-CA method is based on minimizing a constraint objective function to estimate the MS location.

This article uses the hybrid-network-GPS system to minimize the NLOS error when locating the MS. The proposed method is named the hybrid-network-GPS constrained algorithm (HNGPS-CA) which depends on minimizing a constraint objective function to locate the MS. The proposed objective function used in the HNGPS-CA method has the advantage of guaranteed convexity.

A two-phase strategy is employed, where the first phase involves finding feasible point through minimizing a smooth constraint violation function (feasibility phase).

All of the mentioned methods above considered enhancing the system performance by maximizing or minimizing a certain objective function constraint on power consumption at some or all nodes.

The splines are generated through minimizing a cost function subject to constraints imposed by a linear control system and accuracy is improved iteratively using a recursive spline algorithm.

Also, the trailing edge noise was minimized while a constraint was imposed on the efficiency.

In this estimation problem, the squared norm of the PEF impulse response coefficient vector is minimized under a constraint that rules out the trivial solution.

The optimal distribution of the single-channel actuation voltage is formulated as a discrete optimization problem with tri-level design variables, where a least-square function measuring the structural shape error is to be minimized under a constraint on the control effort.

The general idea of penalized regression is that the loss function (usually squared error loss) is minimized under a constraint that penalizes for model complexity and/or large absolute values of coefficients [ 36].

FTM, serving as one of the AGA operators, exploits the promising neighborhood individual by a search mechanism and minimizes a constraint violation of an objective function by a flexible tolerance criterion for near-feasible points.

We consider the optimization problem of minimizing ∫Ω|∇u|pdx with a constraint on the volume of {u>0}.