نتایج جستجو برای: augmented ε constraint
تعداد نتایج: 143005 فیلتر نتایج به سال:
This paper is concerned with the numerical approximation of the isothermal Euler equations for charged particles subject to the Lorentz force (the ’Euler-Lorentz’ system). When the magnetic field is large, or equivalently, when the parameter ε representing the non-dimensional ion cyclotron frequency tends to zero, the so-called drift-fluid (or gyrofluid) approximation is obtained. In this limit...
We present a Lagrangian decomposition algorithmwhich uses logarithmic potential reduction to compute an ε-approximate solution of the general max-min resource sharing problem with M nonnegative concave constraints on a convex set B. We show that this algorithm runs in O(M(ε+lnM)) iterations, a data independent bound which is optimal up to polylogarithmic factors for any fixed relative accuracy ...
The firstand second-order optimum achievable exponents in the simple hypothesis testing problem are investigated. The optimum achievable exponent for type II error probability, under the constraint that the type I error probability is allowed asymptotically up to ε, is called the ε-optimum exponent. In this paper, we first give the second-order ε-optimum exponent in the case where the null hypo...
a f(x) dx (which one would use for instance to compute the work required to move a particle from a to b). For simplicity we shall restrict attention here to functions f : R → R which are continuous on the entire real line (and similarly, when we come to differential forms, we shall only discuss forms which are continuous on the entire domain). We shall also informally use terminology such as “i...
We give a proximal bundle method for minimizing a convex function f over R+. It requires evaluating f and its subgradients with a possibly unknown accuracy ε ≥ 0, and maintains a set of free variables I to simplify its prox subproblems. The method asymptotically finds points that are ε-optimal. In Lagrangian relaxation of convex programs, it allows for ε-accurate solutions of Lagrangian subprob...
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergraphs, certain constraint satisfaction problems, maximum-entropy sampling, and maximum facility-location problems. Our main result is that for any k ≥ 2 and any ε > 0, there is a natural local-search algorithm which has...
Iterative methods are proposed for certain augmented systems of linear equations that arise in interior methods for general nonlinear optimization. Interior methods define a sequence of KKT equations that represent the symmetrized (but indefinite) equations associated with Newton’s method for a point satisfying the perturbed optimality conditions. These equations involve both the primal and dua...
The maximin share guarantee is, in the context of allocating indivisible goods to a set of agents, a recent fairness criterion. A solution achieving a constant approximation of this guarantee always exists and can be computed in polynomial time. We extend the problem to the case where the goods collectively received by the agents satisfy a matroidal constraint. Polynomial approximation algorith...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید