arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.3248cs.DSmath.PR
收藏

基于解耦的规模不经济优化问题

Optimization Problems with Diseconomies of Scale via Decoupling

Konstantin Makarychev, Maxim Sviridenko

摘要:

我们提出了一个新的框架来解决规模不经济的优化问题。在这样的问题中,我们的目标是最小化用于执行特定任务的资源成本。资源的成本随着所使用的资源的量$x$而超线性地增长,如$x^q$、$q\ge 1$。我们定义了一个新的线性规划松弛这样的问题,然后证明了松弛的完整性差距是$A_q$,其中$A_q$是$q$ -th时刻的泊松随机变量的参数为1。使用我们的框架,我们得到的近似算法的最低能效路由,最小度平衡生成树,负载平衡不相关的并行机,和不相关的并行机调度与非线性函数的完成时间问题。我们的分析依赖于非负随机变量的解耦不等式。该不等式表明:$$\big \|\sum_{i=1}^n X_i\big\|_{q} \leq C_q \,\big \|\sum_{i=1}^n Y_i\big\|_{q},$$其中$X_i$是独立的非负随机变量,$Y_i$是可能相依的非负随机变量,且每个$Y_i$与$X_i$具有相同的分布. 1990年,de la Peña证明了这个不等式。De la Peña、Rehgimov和Sharakhmetov(2003年)表明,$C_q\leq 2$用于$q\in (1,2)$,$C_q\leq A_q^{1/q}$用于$q\geq 2$。我们表明,最佳常数是$C_q=A_q^{1/q}$的任何$q\geq 1$。然后,我们证明了一个更一般的不等式:对于每一个凸函数$φ$,$$\mathbb{E}[φ\Big(\sum_{i=1}^n X_i\Big)]\leq \mathbb{E}[φ\Big(P\sum_{i=1}^n Y_i\Big)],$$和,对于每一个凹函数$ψ$,$$\mathbb{E}[ψ\Big(\sum_{i=1}^n X_i\Big)] \geq \mathbb{E}[ψ\Big(P\sum_{i=1}^n Y_i\Big)],$$其中$P$是一个泊松随机变量与参数1独立的随机变量$Y_i$。

英文摘要:

We present a new framework for solving optimization problems with a diseconomy of scale. In such problems, our goal is to minimize the cost of resources used to perform a certain task. The cost of resources grows superlinearly, as $x^q$, $q\ge 1$, with the amount $x$ of resources used. We define a novel linear programming relaxation for such problems, and then show that the integrality gap of the relaxation is $A_q$, where $A_q$ is the $q$-th moment of the Poisson random variable with parameter 1. Using our framework, we obtain approximation algorithms for the Minimum Energy Efficient Routing, Minimum Degree Balanced Spanning Tree, Load Balancing on Unrelated Parallel Machines, and Unrelated Parallel Machine Scheduling with Nonlinear Functions of Completion Times problems. Our analysis relies on the decoupling inequality for nonnegative random variables. The inequality states that $$\big \|\sum_{i=1}^n X_i\big\|_{q} \leq C_q \,\big \|\sum_{i=1}^n Y_i\big\|_{q},$$ where $X_i$ are independent nonnegative random variables, $Y_i$ are possibly dependent nonnegative random variable, and each $Y_i$ has the same distribution as $X_i$. The inequality was proved by de la Peña in 1990. De la Peña, Ibragimov, and Sharakhmetov (2003) showed that $C_q\leq 2$ for $q\in (1,2)$ and $C_q\leq A_q^{1/q}$ for $q\geq 2$. We show that the optimal constant is $C_q=A_q^{1/q}$ for any $q\geq 1$. We then prove a more general inequality: For every convex function $φ$, $$\mathbb{E}[φ\Big(\sum_{i=1}^n X_i\Big)]\leq \mathbb{E}[φ\Big(P\sum_{i=1}^n Y_i\Big)],$$ and, for every concave function $ψ$, $$\mathbb{E}[ψ\Big(\sum_{i=1}^n X_i\Big)] \geq \mathbb{E}[ψ\Big(P\sum_{i=1}^n Y_i\Big)],$$ where $P$ is a Poisson random variable with parameter 1 independent of the random variables $Y_i$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑