线性规划的收缩包裹轨迹
Shrink-Wrapping trajectories for Linear Programming
AI总结:
研究线性规划的收缩包裹轨迹的几何性质,分析其与中心路径的异同,并给出双曲锥凸性的初等证明。
摘要:
双曲规划(HP)——在有限维实向量空间的仿射子空间与所谓双曲锥的交集上最小化线性泛函——是一类包含著名线性规划(LP)的凸优化问题。特别地,对于任何LP,可以容易地给出一个HP松弛序列。基于这些双曲松弛,Renegar提出了一种新的收缩包裹方法来求解LP。由此产生的收缩包裹轨迹在某种意义上推广了内点法中中心路径的概念。我们研究线性规划的收缩包裹轨迹的几何性质。特别地,我们分析了这些轨迹在所谓中心线附近的几何形状,并对比了这些轨迹与某些病态LP实例的中心路径的行为。此外,我们给出了实数域上双曲锥凸性的初等证明。
英文摘要:
Hyperbolic Programming (HP) --minimizing a linear functional over an affine subspace of a finite-dimensional real vector space intersected with the so-called hyperbolicity cone-- is a class of convex optimization problems that contains well-known Linear Programming (LP). In particular, for any LP one can readily provide a sequence of HP relaxations. Based on these hyperbolic relaxations, a new Shrink-Wrapping approach to solve LP has been proposed by Renegar. The resulting Shrink-Wrapping trajectories, in a sense, generalize the notion of central path in interior-point methods. We study the geometry of Shrink-Wrapping trajectories for Linear Programming. In particular, we analyze the geometry of these trajectories in the proximity of the so-called central line, and contrast the behavior of these trajectories with that of the central path for some pathological LP instances. In addition, we provide an elementary proof of convexity of hyperbolicity cones over reals.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。