A Feedback-Based Regularized Primal-Dual Gradient Method for Time-Varying Nonconvex Optimization: Preprint

Andrey Bernstein, Emiliano Dall-Anese, Yujie Tang, Steven Low

Research output: Contribution to conferencePaper

Abstract

This paper considers time-varying nonconvex optimization problems, utilized to model optimal operational trajectories of systems governed by possibly nonlinear physical or logical models. Algorithms for tracking a Karush-Kuhn-Tucker point are synthesized, based on a regularized primal-dual gradient method. In particular, the paper proposes a feedback-based primal-dual gradient algorithm, where analytical models for system state or constraints are replaced with actual measurements. When cost and constraints functions are twice continuously differentiable, conditions for the proposed algorithms to have bounded tracking error are derived, and a discussion of their practical implications is provided. Illustrative numerical simulations are presented for an application in power systems.
Original languageAmerican English
Number of pages10
StatePublished - 2019
Event2018 IEEE Conference on Decision and Control (CDC) - Miami Beach, Florida
Duration: 17 Dec 201819 Dec 2018

Conference

Conference2018 IEEE Conference on Decision and Control (CDC)
CityMiami Beach, Florida
Period17/12/1819/12/18

NREL Publication Number

  • NREL/CP-5D00-73424

Keywords

  • feedback
  • nonconvex
  • optimization
  • primal-dual gradient
  • time-varying

Fingerprint

Dive into the research topics of 'A Feedback-Based Regularized Primal-Dual Gradient Method for Time-Varying Nonconvex Optimization: Preprint'. Together they form a unique fingerprint.

Cite this