نتایج جستجو برای: augmented ε constraint
تعداد نتایج: 143005 فیلتر نتایج به سال:
We consider an optimization problem of minimization of a linear function subject to the chance constraint Prob{G(x, ξ) ∈ C} ≥ 1 − ε, where C is a convex set, G(x, ξ) is bi-affine mapping and ξ is a vector of random perturbations with known distribution. When C is multi-dimensional and ε is small, like 10−6 or 10−10, this problem is, generically, a problem of minimizing under a nonconvex and dif...
We present a novel constraint-partitioning approach for solving continuous nonlinear optimization based on augmented Lagrange method. In contrast to previous work, our approach is based on a new constraint partitioning theory and can handle global constraints. We employ a hyper-graph partitioning method to recognize the problem structure. We prove global convergence under assumptions that are m...
Many engineering systems are too complex to design as a single entity. Decomposition-based design optimization methods partition a system design problem into subproblems, and coordinate subproblem solutions toward an optimal system design. Recent work has addressed formal methods for determining an ideal system partition and coordination strategy, but coordination decisions have been limited to...
We consider the questions of efficient mixing and un-mixing by incompressible flows which satisfy periodic, no-flow, or no-slip boundary conditions on a square. Under the uniform-in-time constraint ‖∇u(·, t)‖p ≤ 1 we show that any function can be mixed to scale ε in time O(| log ε|1+νp), with νp = 0 for p < 3+ √ 5 2 and νp ≤ 13 for p ≥ 3+ √ 5 2 . Known lower bounds show that this rate is optima...
We present approximation algorithms for balanced partitioning problems. These problems are notoriously hard and we present new bicriteria approximation algorithms, that approximate the optimal cost and relax the balance constraint. In the first scenario, we consider Min-Max k-Partitioning, the problem of dividing a graph into k equal-sized parts while minimizing the maximum cost of edges cut by...
In this paper ε-MDP-models are introduced and convergence theorems are proven using the generalized MDP framework of Szepesvári and Littman. Using this model family, we show that Q-learning is capable of finding near-optimal policies in varying environments. The potential of this new family of MDP models is illustrated via a reinforcement learning algorithm called event-learning which separates...
We prove a general result demonstrating the power of Lagrangian relaxation in solving constrained maximization problems with arbitrary objective functions. This yields a unified approach for solving a wide class of subset selection problems with linear constraints. Given a problem in this class and some small ε ∈ (0, 1), we show that if there exists a ρ-approximation algorithm for the Lagrangia...
We consider maximizing a monotone submodular function under cardinality constraint or knapsack in the streaming setting. In particular, elements arrive sequentially and at any point of time, algorithm has access to only small fraction data stored primary memory. propose following algorithms taking O(ε− 1) passes: (1) (1 − e− 1 ε)-approximation for cardinality-constrained problem, (2) (0.5 knaps...
We prove a general result demonstrating the power of Lagrangian relaxation in solving constrained maximization problems with arbitrary objective functions. This yields a unified approach for solving a wide class of subset selection problems with linear constraints. Given a problem in this class and some small ε ∈ (0, 1), we show that if there exists an r-approximation algorithm for the Lagrangi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید