Sentence examples for maximizing a convex from inspiring English sources

Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints were presented in [19].

Since (7) is maximizing a convex function for a given subset L, we cast (7) as 2 l linear programming problems by considering all the possible sign patterns of every element of z L (e.g., if l=2 and L={1,2}, then, ||z L ||1=|z1|+|z2| can correspond to 2 l =4 possibilities: z1+z2, z1−z2, −z1+z2, and −z1−z2).

Once both types of similarity scores are resolved, the network alignment problem is usually posed as that of maximizing a convex combination of these two scores.

Note that subproblem (6) is not a convex optimization problem (Since we maximize a convex function).

This problem is hardly tractable, so we limit ourselves to computing lower bounds (by a column-generation mechanism) and upper bounds (using an algorithm due to Falk and Soland for maximizing a separable convex function over a polytope).

Moreover, maximizing a non-convex acquisition function is required for each iteration of the optimization process.

The seller's problem, to maximize expected revenue, consists of maximizing a linear functional over a convex set of mechanisms.

Since the sum and the minimum operations preserve concavity, the objective is concave, and maximizing a concave function yields a convex optimization problem.

Detailed discussions on ReliefF can be found in [ 10] and recently, it was shown that ReliefF is an on-line solution to a convex optimization problem, maximizing a margin-based algorithm [ 27].

However, since the estimator maximizes a non-convex log-likelihood function, it is hard to theoretically justify its performance.

Thus we are maximizing a concave function with the convex set.