Tracking performance of time-varying nonconvex optimization with application to OPF
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Alberto Padoan.
Optimal power flow (OPF) problems at 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 CUED Control Group Seminars series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|