4.2 Article

Real-Time Stochastic Optimization of Complex Energy Systems on High-Performance Computers

期刊

COMPUTING IN SCIENCE & ENGINEERING
卷 16, 期 5, 页码 32-42

出版社

IEEE COMPUTER SOC
DOI: 10.1109/MCSE.2014.53

关键词

-

资金

  1. US Department of Energy [DE-AC02-06CH11357]
  2. Swiss National Supercomputing Centre [u3]
  3. Office of Science of the US Department of Energy [DE-AC05-00OR22725]
  4. Austrian Science Fund (FWF) [U3] Funding Source: Austrian Science Fund (FWF)

向作者/读者索取更多资源

A scalable approach computes in operationally-compatible time the energy dispatch under uncertainty for electrical power grid systems of realistic size and with thousands of scenarios.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.2
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Engineering, Electrical & Electronic

Convergence Analysis of Fixed Point Chance Constrained Optimal Power Flow Problems

Johannes J. Brust, Mihai Anitescu

Summary: This article analyzes the convergence conditions for a fixed point iteration method used in optimal power flow problems with chance constraints, and presents numerical experiments including for large IEEE networks.

IEEE TRANSACTIONS ON POWER SYSTEMS (2022)

Article Engineering, Electrical & Electronic

Trust-Region Approximation of Extreme Trajectories in Power System Dynamics

Daniel Adrian Maldonado, Emil M. Constantinescu, Hong Zhang, Vishwas Rao, Mihai Anitescu

Summary: This work introduces a novel technique to compute extreme trajectories of power system dynamic simulations using trust-region optimization algorithm and second-order trajectory sensitivities. The method overcomes limitations of previous sensitivity-based techniques in approximating bounds of trajectories in nonlinear scenarios, showing accuracy and scalability in numerical experiments.

IEEE TRANSACTIONS ON POWER SYSTEMS (2022)

Article Engineering, Electrical & Electronic

Failure Probability Constrained AC Optimal Power Flow

Anirudh Subramanyam, Jacob Roth, Albert Lam, Mihai Anitescu

Summary: This paper proposes a reliability-aware approach for power dispatch, which aims to reduce the probability of cascades by considering the failure potential. By utilizing a probability model, the proposed method can effectively decrease the risk of blackouts in power transmission systems.

IEEE TRANSACTIONS ON POWER SYSTEMS (2022)

Article Computer Science, Artificial Intelligence

Multiway p-spectral graph cuts on Grassmann manifolds

Dimosthenis Pasadakis, Christie Louis Alappat, Olaf Schenk, Gerhard Wellein

Summary: The study introduces a novel direct multiway spectral clustering algorithm based on p-norm, using a nonlinear reformulation of the spectral clustering method to achieve improved numerical benefits within a certain range. By recasting the problem and promoting sparser solution vectors, it aims to achieve optimal graph cuts as p approaches one.

MACHINE LEARNING (2022)

Article Engineering, Electrical & Electronic

Distributed Frequency Divider for Power System Bus Frequency Online Estimation Considering Virtual Inertia From DFIGs

Bendong Tan, Junbo Zhao, Nan Duan, Daniel Adrian Maldonado, Yingchen Zhang, Hongming Zhang, Mihai Anitescu

Summary: This paper proposes a distributed frequency divider to estimate power system bus frequency with a limited number of PMUs while considering the inertial contributions from DFIGs. The proposed method reformulates the original frequency divider by modeling the contributions of DFIGs, allowing estimation of local bus frequencies in a distributed manner. The numerical results on real power systems demonstrate the effectiveness and robustness of the proposed method.

IEEE JOURNAL ON EMERGING AND SELECTED TOPICS IN CIRCUITS AND SYSTEMS (2022)

Article Physics, Multidisciplinary

Order-Disorder Transitions in (CaxSr1-x)3Rh4Sn13

Puspa Upreti, Matthew Krogstad, Charlotte Haley, Mihai Anitescu, Vishwas Rao, Lekh Poudel, Omar Chmaissem, Stephan Rosenkranz, Raymond Osborn

Summary: The paper investigates structural correlations in the quasiskutterudites using single crystal x-ray diffraction and finds temperature-independent local atomic displacements below the transition, which persist to well above the transition, indicating order-disorder behavior.

PHYSICAL REVIEW LETTERS (2022)

Article Mathematics, Applied

EXPONENTIAL DECAY OF SENSITIVITY IN GRAPH-STRUCTURED NONLINEAR PROGRAMS

Sungho Shin, Mihai Anitescu, Victor M. Zavala

Summary: This study investigates the solution sensitivity of nonlinear programs based on graph structures and presents the exponential decay result of solution sensitivity with respect to distance. This result holds under the strong second-order sufficiency condition and the linear independence constraint qualification, and is illustrated with numerical examples.

SIAM JOURNAL ON OPTIMIZATION (2022)

Article Computer Science, Software Engineering

An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians

Sen Na, Mihai Anitescu, Mladen Kolar

Summary: In this paper, we propose a stochastic algorithm based on sequential quadratic programming (SQP) for solving nonlinear optimization problems with a stochastic objective and deterministic equality constraints. We introduce a differentiable exact augmented Lagrangian as the merit function and incorporate a stochastic line search procedure to adaptively select the random stepsizes. The global almost sure convergence for both non-adaptive and adaptive SQP methods is established. Numerical experiments demonstrate the superiority of the adaptive algorithm.

MATHEMATICAL PROGRAMMING (2023)

Article Computer Science, Theory & Methods

Level-Based Blocking for Sparse Matrices: Sparse Matrix-Power-Vector Multiplication

Christie Alappat, Georg Hager, Olaf Schenk, Gerhard Wellein

Summary: The researchers improved the performance of sparse matrix polynomial multiplication with a dense vector by using recursive algebraic coloring engine (RACE) and achieving efficient multithreaded parallelization. The implementation showed significant speedups compared to the baseline approach.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2023)

Article Computer Science, Theory & Methods

Parallelized integrated nested Laplace approximations for fast Bayesian inference

Lisa Gaedke-Merzhaeuser, Janet van Niekerk, Olaf Schenk, Havard Rue

Summary: This work presents parallelization strategies for the methodology of integrated nested Laplace approximations (INLA) to meet the growing demand of larger-scale Bayesian inference tasks. The introduced approach leverages nested thread-level parallelism, robust regression and state-of-the-art sparse linear solver PARDISO, resulting in significant speedups in various real-world applications. The improved parallelization scheme is already integrated into the open-source R-INLA package for convenient use.

STATISTICS AND COMPUTING (2023)

Article Automation & Control Systems

Superconvergence of Online Optimization for Model Predictive Control

Sen Na, Mihai Anitescu

Summary: We have developed an online, lag-L, model predictive control (MPC) algorithm that solves discrete-time, equality-constrained, nonlinear dynamic programs with one Newton step per horizon. Based on recent sensitivity analysis results, we have proven that this approach exhibits a behavior called superconvergence, where the tracking error with respect to the full-horizon solution is stable for successive horizon shifts and decreases with increasing shift order to a minimum value that decays exponentially in the length of the receding horizon. We have shown that the algorithmic error achieved quadratic convergence through Newton's method, while the perturbation error decayed exponentially with the lag between consecutive receding horizons. Overall, this approach induces local exponential convergence in terms of the receding horizon length for suitable values of L. Numerical experiments have validated our theoretical findings.

IEEE TRANSACTIONS ON AUTOMATIC CONTROL (2023)

Article Operations Research & Management Science

Accelerating Condensed Interior-Point Methods on SIMD/GPU Architectures

Francois Pacaud, Sungho Shin, Michel Schanen, Daniel Adrian Maldonado, Mihai Anitescu

Summary: The interior-point method (IPM) is widely used in nonlinear programming, and its performance depends on the linear solver employed to solve the Karush-Kuhn-Tucker (KKT) system. We propose a novel reduced-space IPM algorithm that condenses the KKT system into a dense matrix proportional to the number of degrees of freedom. Two variants of the reduced-space method are derived, and computations are accelerated on GPUs. Extensive numerical results show that the reduced-space algorithms outperform Knitro and a hybrid full-space IPM algorithm when the relative number of degrees of freedom decreases.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2023)

Article Computer Science, Software Engineering

Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming

Sen Na, Mihai Anitescu, Mladen Kolar

Summary: We propose an active-set stochastic sequential quadratic programming (StoSQP) algorithm for solving nonlinear optimization problems with a stochastic objective and deterministic constraints. The algorithm uses a differentiable exact augmented Lagrangian as the merit function and adaptively selects penalty parameters. It has been shown to have global convergence and outperforms previous work in terms of nonlinear inequality constraints and sample complexity.

MATHEMATICAL PROGRAMMING (2023)

Article Computer Science, Artificial Intelligence

Sparse Quadratic Approximation for Graph Learning

Dimosthenis Pasadakis, Matthias Bollhoefer, Olaf Schenk

Summary: This paper introduces two algorithms for learning M-matrices, which can be used for graph Laplacian matrix estimation. The first method is an unconstrained approach that uses post processing to learn an M-matrix, and the second method is a constrained approach based on sequential quadratic programming. Experimental results demonstrate the effectiveness, accuracy, and performance of both algorithms.

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (2023)

Article Energy & Fuels

Detecting Large Frequency Excursions in the Power Grid With Bayesian Decision Theory

Amanda Lenzi, Julie Bessac, Mihai Anitescu

Summary: This study proposes statistical models for anticipating disturbances in the frequency response at multiple locations simultaneously and issues real-time event recommendations based on predefined loss functions. The case study shows that the proposed spatiotemporal model better captures uncertainty and increases the probability of identifying large frequency excursions, reducing risks for the system operator.

IEEE OPEN ACCESS JOURNAL OF POWER AND ENERGY (2022)

暂无数据