Time-varying nonconvex optimization with application to OPF

Add to your list(s) Download to your calendar using vCal

• Steven Low (CALTECH (California Institute of Technology))
• Thursday 02 May 2019, 16:00-17:00
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact INI IT.

MESW03 - Closing workshop: Looking forward to 2050

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 )

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• All CMS events
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• bld31

Note that ex-directory lists are not shown.