arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.5832math.OC
收藏

线性规划和半定规划的有效一阶算法

Efficient First-Order Methods for Linear Programming and Semidefinite Programming

James Renegar

摘要:

我们提出了一个简单的变换的任何线性规划或半定规划到等价的凸优化问题,其唯一的约束是线性方程。目标函数定义在整个空间上,使得几乎所有的次梯度方法都可以立即应用。此外,我们观察到,目标函数自然平滑,从而允许大多数一阶方法被应用。我们开发的一个特定的次梯度方法的非平滑的情况下,在平滑的情况下,Nesterov的原始最佳一阶方法的光滑函数的复杂性界限。我们分别实现了迭代次数($ O(1/ ε^2) $和$ O(1/ ε) $)的期望界限。也许最令人惊讶的是,从线性规划或半定规划的转换是简单的,基本理论也是如此,但这种方法一直被忽视,直到现在,一个盲点。一旦实现了转换,剩下的建立复杂性界限的工作主要是简单的,通过利用Nesterov的各种作品。

英文摘要:

We present a simple transformation of any linear program or semidefinite program into an equivalent convex optimization problem whose only constraints are linear equations. The objective function is defined on the whole space, making virtually all subgradient methods be immediately applicable. We observe, moreover, that the objective function is naturally smoothed, thereby allowing most first-order methods to be applied. We develop complexity bounds in the unsmoothed case for a particular subgradient method, and in the smoothed case for Nesterov's original optimal first-order method for smooth functions. We achieve the desired bounds on the number of iterations, $ O(1/ ε^2) $ and $ O(1/ ε) $, respectively. Perhaps most surprising is that the transformation from a linear program or a semidefinite program is simple and so is the basic theory, and yet the approach has been overlooked until now, a blind spot. Once the transformation is realized, the remaining effort in establishing complexity bounds is mainly straightforward, by making use of various works of Nesterov.

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

↑