arXiv subjects

Carleton Coffrin

Publications and source records attributed to Carleton Coffrin.

At least 55 records · Page 3Linked to original sources

arXiv2020

PowerModelsRestoration.jl: An Open-Source Framework for Exploring Power Network Restoration Algorithms

With the escalating frequency of extreme grid disturbances, such as natural disasters, comes an increasing need for efficient recovery plans. Algorithms for optimal power restoration play an important role in developing such plans, but also give rise to challenging mixed-integer nonlinear optimization problems, where tractable solution methods are not yet available. To assist in research on such solution methods, this work proposes PowerModelsRestoration, a flexible, open-source software framework for rapidly designing and testing power restoration algorithms. PowerModelsRestoration constructs a mathematical modeling layer for formalizing core restoration tasks that can be combined to develop complex workflows and high performance heuristics. The efficacy of the proposed framework is demonstrated by proof-of-concept studies on three established cases from the literature, focusing on single-phase positive sequence network models. The results demonstrate that PowerModelsRestoration reproduces the established literature, and for the first time provide an analysis of restoration with nonlinear power flow models, which have not been previously considered.

eess.SY↗

arXiv2020

PowerModelsDistribution.jl: An Open-Source Framework for Exploring Distribution Power Flow Formulations

In this work we introduce PowerModelsDistribution, a free, open-source toolkit for distribution power network optimization, whose primary focus is establishing a baseline implementation of steady-state multi-conductor unbalanced distribution network optimization problems, which includes implementations of Power Flow and Optimal Power Flow problem types. Currently implemented power flow formulations for these problem types include AC (polar and rectangular), a second-order conic relaxation of the Branch Flow Model (BFM) and Bus Injection Model (BIM), a semi-definite relaxation of BFM, and several linear approximations, such as the simplified unbalanced BFM. The results of AC power flow have been validated against OpenDSS, an open-source "electric power distribution system simulator", using IEEE distribution test feeders (13, 34, 123 bus and LVTestCase), all parsed using a built-in OpenDSS parser. This includes support for standard distribution system components as well as novel resource models such as generic energy storage (multi-period) and photovoltaic systems, with the intention to add support for additional components in the future.

cs.CE↗

arXiv2019

Exploring Benefits of Linear Solver Parallelism on Modern Nonlinear Optimization Applications

The advent of efficient interior point optimization methods has enabled the tractable solution of large-scale linear and nonlinear programming (NLP) problems. A prominent example of such a method is seen in Ipopt, a widely-used, open-source nonlinear optimization solver. Algorithmically, Ipopt depends on the use of a sparse symmetric indefinite linear system solver, which is heavily employed within the optimization of barrier subproblems. As such, the performance and reliability of Ipopt is dependent on the properties of the selected linear solver. Inspired by a trend in mathematical programming toward solving larger and more challenging NLPs, this work explores two core questions: first, how does the scalability of available linear solvers, many of which exhibit shared-memory parallelism, impact Ipopt performance; and second, does the best linear solver vary across NLP problem classes, including nonlinear network problems and problems constrained by partial differential equations? To better understand these properties, this paper first describes available open- and closed-source, serial and parallel linear solvers and the fundamental differences among them. Second, it introduces the coupling of a new open-source linear solver capable of heterogeneous parallelism over multi-core central processing units and graphics processing units. Third, it compares linear solvers using a variety of mathematical programming problems, including standard test problems for linear and nonlinear optimization, optimal power flow benchmarks, and scalable two- and three-dimensional partial differential equation and optimal control problems. Finally, linear solver recommendations are provided to maximize Ipopt performance across different application domains.

math.OC↗

arXiv2019

NESTA, The NICTA Energy System Test Case Archive

In recent years the power systems research community has seen an explosion of work applying operations research techniques to challenging power network optimization problems. Regardless of the application under consideration, all of these works rely on power system test cases for evaluation and validation. However, many of the well established power system test cases were developed as far back as the 1960s with the aim of testing AC power flow algorithms. It is unclear if these power flow test cases are suitable for power system optimization studies. This report surveys all of the publicly available AC transmission system test cases, to the best of our knowledge, and assess their suitability for optimization tasks. It finds that many of the traditional test cases are missing key network operation constraints, such as line thermal limits and generator capability curves. To incorporate these missing constraints, data driven models are developed from a variety of publicly available data sources. The resulting extended test cases form a compressive archive, NESTA, for the evaluation and validation of power system optimization algorithms.

cs.AI↗

arXiv2019

Evaluating Ising Processing Units with Integer Programming

The recent emergence of novel computational devices, such as adiabatic quantum computers, CMOS annealers, and optical parametric oscillators, present new opportunities for hybrid-optimization algorithms that are hardware accelerated by these devices. In this work, we propose the idea of an Ising processing unit as a computational abstraction for reasoning about these emerging devices. The challenges involved in using and benchmarking these devices are presented and commercial mixed integer programming solvers are proposed as a valuable tool for the validation of these disparate hardware platforms. The proposed validation methodology is demonstrated on a D-Wave 2X adiabatic quantum computer, one example of an Ising processing unit. The computational results demonstrate that the D-Wave hardware consistently produces high-quality solutions and suggests that as IPU technology matures it could become a valuable co-processor in hybrid-optimization algorithms.

math.OC↗

arXiv2019

Optimization-Based Bound Tightening using a Strengthened QC-Relaxation of the Optimal Power Flow Problem

This article develops a strengthened convex quadratic convex (QC) relaxation of the AC Optimal Power Flow (AC-OPF) problem and presents an optimization-based bound-tightening (OBBT) algorithm to compute tight, feasible bounds on the voltage magnitude variables for each bus and the phase angle difference variables for each branch in the network. Theoretical properties of the strengthened QC relaxation that show its dominance over the other variants of the QC relaxation studied in the literature are also derived. The effectiveness of the strengthened QC relaxation is corroborated via extensive numerical results on benchmark AC-OPF test networks. In particular, the results demonstrate that the proposed relaxation consistently provides the tightest variable bounds and optimality gaps with negligible impacts on runtime performance.

math.OC↗

arXiv2019

The ISTI Rapid Response on Exploring Cloud Computing 2018

This report describes eighteen projects that explored how commercial cloud computing services can be utilized for scientific computation at national laboratories. These demonstrations ranged from deploying proprietary software in a cloud environment to leveraging established cloud-based analytics workflows for processing scientific datasets. By and large, the projects were successful and collectively they suggest that cloud computing can be a valuable computational resource for scientific computation at national laboratories.

cs.DC↗

arXiv2018

Relaxations of AC Maximal Load Delivery for Severe Contingency Analysis

This work considers the task of finding an AC-feasible operating point of a severely damaged transmission network while ensuring that a maximal amount of active power loads can be delivered. This AC Maximal Load Delivery (AC-MLD) task is a nonconvex nonlinear optimization problem that is incredibly challenging to solve on large-scale transmission system datasets. This work demonstrates that convex relaxations of the AC-MLD problem provide a reliable and scalable method for finding high-quality bounds on the amount of active power that can be delivered in the AC-MLD problem. To demonstrate their effectiveness, the solution methods proposed in this work are rigorously evaluated on 1000 N-k scenarios on seven power networks ranging in size from 70 to 6000 buses. The most effective relaxation of the AC-MLD problem converges in less than 20 seconds on commodity computing hardware for all 7000 of the scenarios considered.

math.OC↗

arXiv2018

Convex Relaxations in Power System Optimization: A Brief Introduction

Convex relaxations of the AC power flow equations have attracted significant interest in the power systems research community in recent years. The following collection of video lectures provides a brief introduction to the mathematics of AC power systems, continuous nonlinear optimization, and relaxations of the power flow equations. The aim of the videos is to provide the high level ideas of convex relaxations and their applications in power system optimization, and could be used as a starting point for researchers who want to study, use or develop new convex relaxations for use in their own research. The videos do not aim to provide an in-depth tutorial about specific convex relaxations, but rather focus on ideas that are common to all convex relaxations of the AC optimal power flow problem.

math.OC↗

arXiv2018

Probabilistic $N$-$k$ Failure-Identification for Power Systems

This paper considers a probabilistic generalization of the $N$-$k$ failure-identification problem in power transmission networks, where the probability of failure of each component in the network is known a priori and the goal of the problem is to find a set of $k$ components that maximizes disruption to the system loads weighted by the probability of simultaneous failure of the $k$ components. The resulting problem is formulated as a bilevel mixed-integer nonlinear program. Convex relaxations, linear approximations, and heuristics are developed to obtain feasible solutions that are close to the optimum. A general cutting-plane algorithm is proposed to solve the convex relaxation and linear approximations of the $N$-$k$ problem. Extensive numerical results corroborate the effectiveness of the proposed algorithms on small-, medium-, and large-scale test instances, the test instances include the IEEE 14-bus system, the IEEE single-area and three-area RTS96 systems, the IEEE 118-bus system, the WECC 240-bus test system, the 1354-bus PEGASE system, and the 2383-bus Polish winter-peak test system.

eess.SY↗

arXiv2018

DistFlow Extensions for AC Transmission Systems

Convex relaxations of the power flow equations and, in particular, the Semi-Definite Programming (SDP), Second-Order Cone (SOC), and Convex DistFlow (CDF) relaxations, have attracted significant interest in recent years. Thus far, studies of the CDF model and its connection to the other relaxations have been limited to power distribution systems, which omit several parameters necessary for modeling transmission systems. To increase the applicability of the CDF relaxation, this paper develops an extended CDF model that is suitable for transmission systems by incorporating bus shunts, line charging, and transformers. Additionally, a theoretical result shows that the established equivalence of the SOC and CDF models for distribution systems also holds in this transmission system extension.

math.OC↗

arXiv2018

Juniper: An Open-Source Nonlinear Branch-and-Bound Solver in Julia

Nonconvex mixed-integer nonlinear programs (MINLPs) represent a challenging class of optimization problems that often arise in engineering and scientific applications. Because of nonconvexities, these programs are typically solved with global optimization algorithms, which have limited scalability. However, nonlinear branch-and-bound has recently been shown to be an effective heuristic for quickly finding high-quality solutions to large-scale nonconvex MINLPs, such as those arising in infrastructure network optimization. This work proposes Juniper, a Julia-based open-source solver for nonlinear branch-and-bound. Leveraging the high-level Julia programming language makes it easy to modify Juniper's algorithm and explore extensions, such as branching heuristics, feasibility pumps, and parallelization. Detailed numerical experiments demonstrate that the initial release of Juniper is comparable with other nonlinear branch-and-bound solvers, such as Bonmin, Minotaur, and Knitro, illustrating that Juniper provides a strong foundation for further exploration in utilizing nonlinear branch-and-bound algorithms as heuristics for nonconvex MINLPs.

math.OC↗

arXiv2018

PowerModels.jl: An Open-Source Framework for Exploring Power Flow Formulations

In recent years, the power system research community has seen an explosion of novel methods for formulating and solving power network optimization problems. These emerging methods range from new power flow approximations, which go beyond the traditional DC power flow by capturing reactive power, to convex relaxations, which provide solution quality and runtime performance guarantees. Unfortunately, the sophistication of these emerging methods often presents a significant barrier to evaluating them on a wide variety of power system optimization applications. To address this issue, this work proposes PowerModels, an open-source platform for comparing power flow formulations. From its inception, PowerModels was designed to streamline the process of evaluating different power flow formulations on shared optimization problem specifications. This work provides a brief introduction to the design of PowerModels, validates its implementation, and demonstrates its effectiveness with a proof-of-concept study analyzing five different formulations of the Optimal Power Flow problem.

math.OC↗

arXiv2016

Strengthening the SDP Relaxation of AC Power Flows with Convex Envelopes, Bound Tightening, and Lifted Nonlinear Cuts

This paper considers state-of-the-art convex relaxations for the AC power flow equations and introduces new valid cuts based on convex envelopes and lifted nonlinear constraints. These valid linear inequalities strengthen existing semidefinite and quadratic programming relaxations and dominate existing cuts proposed in the litterature. Together with model intersections and bound tightening, the new linear cuts close 8 of the remaining 16 open test cases in the NESTA archive for the AC Optimal Power Flow problem.

math.OC↗

arXiv2015

Network Flow and Copper Plate Relaxations for AC Transmission Systems

Nonlinear convex relaxations of the power flow equations and, in particular, the Semi-Definite Programming (SDP), Convex Quadratic (QC), and Second-Order Cone (SOC) relaxations, have attracted significant interest in recent years. Thus far, little attention has been given to simpler linear relaxations of the power flow equations, which may bring significant performance gains at the cost of model accuracy. To fill the gap, this paper develops two intuitive linear relaxations of the power flow equations, one based on classic network flow models (NF) and another inspired by copper plate approximations (CP). Theoretical results show that the proposed NF model is a relaxation of the established nonlinear SOC model and the CP model is a relaxation of the NF model. Consequently, considering the linear NF and CP relaxations alongside the established nonlinear relaxations (SDP, QC, SOC) provides a rich variety of tradeoffs between the relaxation accuracy and performance.

math.OC↗

arXiv2015

Polynomial SDP Cuts for Optimal Power Flow

The use of convex relaxations has lately gained considerable interest in Power Systems. These relaxations play a major role in providing global optimality guarantees for non-convex optimization problems. For the Optimal Power Flow (OPF) problem, the Semi-Definite Programming (SDP) relaxation is known to produce tight lower bounds. Unfortunately, SDP solvers still suffer from a lack of scalability. In this work, we introduce a new set of polynomial SDP-based constraints, strengthening weaker quadratic convex relaxations. The SDP cuts, expressed as polynomial constraints, can be handled by standard Nonlinear Programming solvers, enjoying better stability and computational efficiency. The new cut-generation procedure benefits from recent results on tree-decomposition methods, reducing the dimension of the underlying SDP matrices. As a side result, we present the first formulation of Kirchhoff's Voltage Law in the SDP space and reveal the existing link between these cycle constraints and the original SDP relaxation for three dimensional matrices. Numerical results on state-of-the- art benchmarks show a significant gain both in computational efficiency and optimality bound quality.

math.OC↗

arXiv2015

The QC Relaxation: Theoretical and Computational Results on Optimal Power Flow

Convex relaxations of the power flow equations and, in particular, the Semi-Definite Programming (SDP) and Second-Order Cone (SOC) relaxations, have attracted significant interest in recent years. The Quadratic Convex (QC) relaxation is a departure from these relaxations in the sense that it imposes constraints to preserve stronger links between the voltage variables through convex envelopes of the polar representation. This paper is a systematic study of the QC relaxation for AC Optimal Power Flow with realistic side constraints. The main theoretical result shows that the QC relaxation is stronger than the SOC relaxation and neither dominates nor is dominated by the SDP relaxation. In addition, comprehensive computational results show that the QC relaxation may produce significant improvements in accuracy over the SOC relaxation at a reasonable computational cost, especially for networks with tight bounds on phase angle differences. The QC and SOC relaxations are also shown to be significantly faster and reliable compared to the SDP relaxation given the current state of the respective solvers.

cs.CE↗

arXiv2013

A Linear-Programming Approximation of AC Power Flows

Linear active-power-only DC power flow approximations are pervasive in the planning and control of power systems. However, these approximations fail to capture reactive power and voltage magnitudes, both of which are necessary in many applications to ensure voltage stability and AC power flow feasibility. This paper proposes linear-programming models (the LPAC models) that incorporate reactive power and voltage magnitudes in a linear power flow approximation. The LPAC models are built on a convex approximation of the cosine terms in the AC equations, as well as Taylor approximations of the remaining nonlinear terms. Experimental comparisons with AC solutions on a variety of standard IEEE and MatPower benchmarks show that the LPAC models produce accurate values for active and reactive power, phase angles, and voltage magnitudes. The potential benefits of the LPAC models are illustrated on two "proof-of-concept" studies in power restoration and capacitor placement.

cs.AI↗