Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published December 2018 | Published
Journal Article Open

A Primal-Dual Gradient Method for Time-Varying Optimization with Application to Power Systems

Abstract

We consider time-varying nonconvex optimization problems where the objective function and the feasible set vary over discrete time. This sequence of optimization problems induces a trajectory of Karush-Kuhn-Tucker (KKT) points. We present a class of regularized primal-dual gradient algorithms that track the KKT trajectory. These algorithms are feedback-based algorithms, where analytical models for system state or constraints are replaced with actual measurements. We present conditions for the proposed algorithms to achieve bounded tracking error when the cost and constraint functions are twice continuously differentiable. We discuss their practical implications and illustrate their applications in power systems through numerical simulations.

Additional Information

© 2018 is held by author/owner(s).

Attached Files

Published - p92-tang.pdf

Files

p92-tang.pdf
Files (845.2 kB)
Name Size Download all
md5:e10008d59ba2774900fe75e2e6eb53fd
845.2 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 20, 2023