paper-with-me

홈 › Papers

Fast Nonconvex SDP Solvers for Large-scale Power System State Estimation

2019-06-19

Fast power system state estimation (SE) solution is of paramount importance for achieving real-time decision making in power grid operations. Semidefinite programming (SDP) reformulation has been shown effective to obtain the global optimum for the nonlinear SE problem, while suffering from high computational complexity. Thus, we leverage the recent advances in nonconvex SDP approach that allows for the simple first-order gradient-descent (GD) updates. Using the power system model, we can verify that the SE objective function enjoys nice properties (strongly convex, smoothness) which in turn guarantee a linear convergence rate of the proposed GD-based SE method. To further accelerate the convergence speed, we consider the accelerated gradient descent (AGD) extension, as well as their robust versions under outlier data and a hybrid GD-based SE approach with additional synchrophasor measurements. Numerical tests on the IEEE 118-bus, 300-bus and the synthetic ACTIVSg2000-bus systems have demonstrated that FGD-SE and AGD-SE, can approach the near-optimal performance of the SDP-SE solution at significantly improved computational efficiency, especially so for AGD-SE.

📄 PDF Abstract BibTeX arXiv:1906.07970

Code (0)

등록된 구현이 없습니다.

Tasks

Computational EfficiencyDecision MakingState Estimation

Similar Papers 제목 키워드 기반

An efficient nonconvex reformulation of stagewise convex optimization problems

2020-10-27 · NeurIPS 2020 12 · Rudy Bunel, Oliver Hinder, Srinadh Bhojanapalli, Krishnamurthy 외

Convex optimization problems with staged structure appear in several contexts, including optimal control, verification of deep neural networks, and isotonic regression. Off-the-shelf solvers can solve these problems but …

Proximal Iteratively Reweighted Algorithm with Multiple Splitting for Nonconvex Sparsity Optimization

2014-04-28 · Canyi Lu, Yunchao Wei, Zhouchen Lin, Shuicheng Yan

This paper proposes the Proximal Iteratively REweighted (PIRE) algorithm for solving a general problem, which involves a large body of nonconvex sparse and structured sparse related problems. Comparing with previous iter…

Homotopy-Guided Self-Supervised Learning of Parametric Solutions for AC Optimal Power Flow

2025-11-11 · Shimiao Li, Aaron Tuor, Draguna Vrabie, Larry Pileggi 외 arxiv

Learning to optimize (L2O) parametric approximations of AC optimal power flow (AC-OPF) solutions offers the potential for fast, reusable decision-making in real-time power system operations. However, the inherent nonconv…

Self-Supervised Learning

An Equivalent Circuit Approach to Distributed Optimization

2023-05-24 · Aayushya Agarwal, Larry Pileggi

Distributed optimization is an essential paradigm to solve large-scale optimization problems in modern applications where big-data and high-dimensionality creates a computational bottleneck. Distributed optimization algo…

Distributed OptimizationNumerical Integration

Learning Optimal Solutions for Extremely Fast AC Optimal Power Flow

2019-09-27 · Ahmed Zamzam, Kyri Baker

In this paper, we develop an online method that leverages machine learning to obtain feasible solutions to the AC optimal power flow (OPF) problem with negligible optimality gaps on extremely fast timescales (e.g., milli…