Nov 28, 2016, INF017

Andreas kettner: Improved L-index for microgrid stability assessment

Asja Derviskadic: New class M PMU

Cong Wang: Existence and Uniqueness of Load-Flow Solutions

Eleni Stai: Dispatching of Stochastic Heterogeneous Resources Accounting for Grid Losses and Imperfect Batteries

11 :00 Session 2

Enrica Scolari: Model-driven forecasting of PV

Fabrizio Sossan: Dispatchable feeder

Lorenzo Reyes: Experimental validation of the COMMELEC

Lorenzo Zanni: PECE method

Tech Tesfay: PMU patching

12 :45 Session 3

Marco Pignati: RTSE applications to locate faults

Mokhtar Bozorg: Impact of dispatchable feeders on the system reliability and reserve

Mostafa Nick: AR-OPF

Nadia Christakou: Inference of admittance matrix from measurements

14 :00 Session 4

Roman Rudnik: Handling Large Power Steps in Real-Time Microgrid Control

Sergio Barreto: Undetectable timing-attacks on linear state estimators

Maaz Mohiuddin: Tolerating delay faults in the Commelec controller

Wajeb Saab: Reliability of Control Point

Sparse estimation problems show up in many engineering projects where the measurements are few compared to the unknown variables to be estimated with the additional information that majority of the unknowns are expected to be exactly zero. Such problems can be shown to exist in power grid operation by reformulating the problems to transform the unknown vector into a sparse array by exploiting the special structure of the power network equations. In this talk we will describe two such problems. The first one considers identification of branch outages for grids which are not fully observable. Possible cases include identification of outages in external systems from which a very limited number of real-time measurements are typically available. The problem of line outage identification will be formulated as a sparse selection problem and will be solved by a mixed integer programming algorithm. The second application considers fault identification and location in power grids where synchronized voltage measurements are sparsely available at a limited number of buses. Fault location and identification is first formulated as a sparse regression problem and then solved using the least absolute selection and shrinkage operator (lasso) algorithm. The approach appears to work irrespective of the fault type and branch configuration. These and other similar applications are expected to motivate further work in effective utilization of synchrophasors which are quickly populating power grids all around the globe.
Slides from the talk.
**************************************************************************************************
**Friday 13 March 2015 17:00 BC 329**
**Title: Distributed Non-Convex Optimization, Application to the Optimal AC Power Flow**
**Speaker: Jean-Hubert Hours, STI, EPFL**

Many engineering problems, such as the optimal AC power flow, can be cast as nonlinear programs involving network constraints. For solving such problems, distributed optimization strategies are becoming increasingly popular. However, for such methods, convergence guarantees generally hinge upon convexity, which is not satisfied in a significant number of practical cases. In this talk, we present a novel decomposition algorithm for solving distributed non-convex programs with convergence guarantees to a local minimum. We further discuss the applicability of our approach to solve parametric nonlinear programs, as they arise in real-time optimization, and present theoretical results about stability of the optimality tracking scheme. Moreover, we show how the local convergence rate of our algorithm can be improved by merging it with an inexact Newton method, while preserving a distributed algorithmic structure. The proposed algorithm is successfully applied to compute local solutions to optimal AC power flow problems over transmission and distribution networks. Slides from the talk. **************************************************************************************************

Resources from the old web site: Talks. Reading group announcements.