使用基于梯度的优化方法实现GPU加速的DCOPF
GPU-Accelerated DCOPF using Gradient-Based Optimization
AI总结:
针对传统CPU求解DCOPF难以并行且速度饱和的问题,提出基于GPU的拉格朗日对偶与投影梯度上升求解方法,在IEEE大规模节点系统上相比传统求解器最高实现5.4倍加速并提供紧的下界。
摘要:
直流最优潮流(DCOPF)是电力系统运营商的关键运行工具,并作为子问题嵌入在许多具有挑战性的优化问题(例如,线路开关)中。然而,传统的基于CPU的求解例程(例如,单纯形法)在速度上已经饱和,并且难以并行化。本文专注于在具有大规模并行化能力的图形处理器(GPU)上,使用基于梯度的例程求解DCOPF问题。为了构建这些问题,我们提出了与DCOPF(线性和二次成本曲线)相关的拉格朗日对偶,然后使用对偶范数显式求解内部(原始)最小化问题。由此产生的对偶问题可以使用投影梯度上升法进行高效迭代。在CPU和GPU上求解对偶问题以找到紧的下界后,我们以Gurobi和MOSEK为基准,在IEEE 2000、4601和10000节点系统上比较了收敛速度和紧致性。我们为这些问题提供了可靠且紧的下界,与传统求解器相比最高实现了5.4倍的加速。
英文摘要:
DC Optimal Power Flow (DCOPF) is a key operational tool for power system operators, and it is embedded as a subproblem in many challenging optimization problems (e.g., line switching). However, traditional CPU-based solve routines (e.g., simplex) have saturated in speed and are hard to parallelize. This paper focuses on solving DCOPF problems using gradient-based routines on Graphics Processing Units (GPUs), which have massive parallelization capability. To formulate these problems, we pose a Lagrange dual associated with DCOPF (linear and quadratic cost curves), and then we explicitly solve the inner (primal) minimization problem with a dual norm. The resulting dual problem can be efficiently iterated using projected gradient ascent. After solving the dual problem on both CPUs and GPUs to find tight lower bounds, we benchmark against Gurobi and MOSEK, comparing convergence speed and tightness on the IEEE 2000, 4601, and 10000 bus systems. We provide reliable and tight lower bounds for these problems with, at best, 5.4x speedup over a conventional solver.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。