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

求多面体锥组最大支撑解的投影和重标度算法

Projection and rescaling algorithm for finding maximum support solutions to polyhedral conic systems

Javier Pena, Negar Soheili

摘要:

我们提出了一个简单的投影和重新缩放算法,找到最大支持解决方案的可行性问题对\[ \text{find} \; x\in L\cap\mathbb{R}^n_{+} \;\;\;\; \text{ and } \; \;\;\;\; \text{find} \; \hat x\in L^\perp\cap\mathbb{R}^n_{+}, \]其中$L$是一个线性子空间的$\mathbb{R}^n$和$L^\perp$是它的正交补。该算法补充了一个基本的程序,只涉及到$L$和$L^\perp$与周期性的重新缩放步骤的投影。重新缩放步骤的数量以及因此由算法执行的总体计算工作在上述问题对的条件度量方面是有界的。我们的算法是一个自然的,但以前的投影和重新缩放算法,找到一个解决方案的问题\[ \text{find} \; x\in L\cap\mathbb{R}^n_{++} \]时,这个问题是可行的显着扩展。作为我们的新发展的副产品,我们获得了更清晰的分析,在后者的特殊情况下的投影和重新缩放算法。

英文摘要:

We propose a simple projection and rescaling algorithm that finds maximum support solutions to the pair of feasibility problems \[ \text{find} \; x\in L\cap\mathbb{R}^n_{+} \;\;\;\; \text{ and } \; \;\;\;\; \text{find} \; \hat x\in L^\perp\cap\mathbb{R}^n_{+}, \] where $L$ is a linear subspace of $\mathbb{R}^n$ and $L^\perp$ is its orthogonal complement. The algorithm complements a basic procedure that involves only projections onto $L$ and $L^\perp$ with a periodic rescaling step. The number of rescaling steps and thus overall computational work performed by the algorithm are bounded above in terms of a condition measure of the above pair of problems. Our algorithm is a natural but significant extension of a previous projection and rescaling algorithm that finds a solution to the problem \[ \text{find} \; x\in L\cap\mathbb{R}^n_{++} \] when this problem is feasible. As a byproduct of our new developments, we obtain a sharper analysis of the projection and rescaling algorithm in the latter special case.

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

↑