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

球面上的Optimization:模型和近似算法及其计算性能比较

Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons

D. Russell Luke, Shoham Sabach, Marc Teboulle

摘要:

我们提出了一个统一的处理抽象的问题,找到最佳的近似之间的图像的仿射变换的圆锥和球体。这个问题的突出例子是相位恢复和源定位。共同的几何约束这些问题允许一个通用的应用程序的算法思想和抽象的收敛结果的非凸优化。我们组织这个问题的变分模型分为三个不同的类,并在这些类(共13个)的主要算法方法。我们确定了这些方法的核心思想,并提供了全面的数值基准比较其性能的合成和实验室数据。我们实验的软件和数据都是公开的。我们还介绍了一种新的算法,循环松弛道格拉斯-Rachford算法,它优于所有其他算法的每一个措施:速度,稳定性和准确性。对该算法的分析仍然是开放的。

英文摘要:

We present a unified treatment of the abstract problem of finding the best approximation between a cone and spheres in the image of affine transformations. Prominent instances of this problem are phase retrieval and source localization. The common geometry binding these problems permits a generic application of algorithmic ideas and abstract convergence results for nonconvex optimization. We organize variational models for this problem into three different classes and derive the main algorithmic approaches within these classes (13 in all). We identify the central ideas underlying these methods and provide thorough numerical benchmarks comparing their performance on synthetic and laboratory data. The software and data of our experiments are all publicly accessible. We also introduce one new algorithm, a cyclic relaxed Douglas-Rachford algorithm, which outperforms all other algorithms by every measure: speed, stability and accuracy. The analysis of this algorithm remains open.

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

↑