arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1708.02079math.OCstat.CO
收藏

具有非凸形状约束的离散矩问题

The discrete moment problem with nonconvex shape constraints

Xi Chen, Simai He, Bo Jiang, Christopher Thomas Ryan, Teng Zhang

摘要:

离散矩问题是无分布鲁棒优化中的一个基本问题,其目标是找到一个满足给定矩集的最坏情况分布。本文研究了具有附加“形状约束”的离散矩问题,该约束保证了最坏情况的分布要么是对数凹的,要么具有递增的故障率。这些类的形状约束以前没有在文献中研究,部分原因是由于其固有的非凸性。尽管如此,这些类型的分布在实践中是有用的。我们的最佳极值点分布的结构的特点,通过开发新的结果,在反凸优化,一个鲜为人知的工具,以前在设计全局优化算法。我们能够显示,例如,一个最佳的极值点解决方案的时刻问题与$m$时刻和日志凹形状约束是分段几何与最多$m$件。此外,这种结构使我们能够设计一个精确的算法计算最优解在低维空间的参数。此外,我们描述了一种计算方法来解决这些低维问题,包括一组有代表性的实例的数值结果。

英文摘要:

The discrete moment problem is a foundational problem in distribution-free robust optimization, where the goal is to find a worst-case distribution that satisfies a given set of moments. This paper studies the discrete moment problems with additional "shape constraints" that guarantee the worst case distribution is either log-concave or has an increasing failure rate. These classes of shape constraints have not previously been studied in the literature, in part due to their inherent nonconvexities. Nonetheless, these classes of distributions are useful in practice. We characterize the structure of optimal extreme point distributions by developing new results in reverse convex optimization, a lesser-known tool previously employed in designing global optimization algorithms. We are able to show, for example, that an optimal extreme point solution to a moment problem with $m$ moments and log-concave shape constraints is piecewise geometric with at most $m$ pieces. Moreover, this structure allows us to design an exact algorithm for computing optimal solutions in a low-dimensional space of parameters. Moreover, We describe a computational approach to solving these low-dimensional problems, including numerical results for a representative set of instances.

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

↑