skip to content
 

Time-varying nonconvex optimization with application to OPF

Presented by: 
Steven Low CALTECH (California Institute of Technology)
Date: 
Thursday 2nd May 2019 - 16:00 to 17:00
Venue: 
INI Seminar Room 1
Abstract: 
Optimal power flow (OPF) problems are fundamental for power system operations.
They are nonconvex and, in future applications, time-varying. We present
a first-order proximal primal-dual algorithm and a second-order algorithm
for general time-varying nonconvex optimization and bound their tracking
performance. We incorporate real-time feedback in our algorithms for
applications to time-varying OPF problems, and illustrate their tracking
performance numerically.

(Joint work with Yujie Tang, Caltech, Emiliano Dall’Anese, U of Colorado,
Andrey Berstein, NREL)
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons