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

一种基于自适应采样的渐进对冲算法用于随机规划

An Adaptive Sampling-based Progressive Hedging Algorithm for Stochastic Programming

Di Zhang, Yihang Zhang, Suvrajeet Sen

AI总结:

本文提出一种基于自适应采样的渐进对冲算法,通过动态选择情景子问题数量、自适应序贯采样、随机共轭次梯度方向和线搜索更新对偶变量,克服传统PHA的计算瓶颈并提升可扩展性。

摘要:

渐进对冲算法(PHA)是求解大规模随机规划问题的核心算法之一。然而,其传统实现受到若干局限性的制约,包括每次迭代都需要求解所有情景子问题、依赖显式概率分布,以及收敛过程对某些惩罚参数的选择高度敏感。本文提出一种基于采样的PHA,旨在克服这些局限性。我们的方法对每次迭代求解的情景子问题数量采用动态选择过程。该方法结合了用于确定样本量的自适应序贯采样、用于方向寻找的随机共轭次梯度方法,以及用于更新对偶变量的线搜索技术。实验结果表明,这种新算法不仅解决了传统PHA的瓶颈问题,而且可能超越其可扩展性,代表了随机规划领域的一项实质性改进。

英文摘要:

The progressive hedging algorithm (PHA) is a cornerstone among algorithms for large-scale stochastic programming problems. However, its traditional implementation is hindered by some limitations, including the requirement to solve all scenario subproblems in each iteration, reliance on an explicit probability distribution, and a convergence process that is highly sensitive to the choice of certain penalty parameters. This paper introduces a sampling-based PHA which aims to overcome these limitations. Our approach employs a dynamic selection process for the number of scenario subproblems solved per iteration. It incorporates adaptive sequential sampling for determining sample sizes, a stochastic conjugate subgradient method for direction finding, and a line-search technique to update the dual variables. Experimental results demonstrate that this novel algorithm not only addresses the bottlenecks of the conventional PHA but also potentially surpasses its scalability, representing a substantial improvement in the field of stochastic programming.

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

↑