On the design of optimal structured and sparse feedback gains via sequential convex programming

Makan Fardad, Mihailo Jovanovic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

47 Scopus citations

Abstract

We consider the problem of finding optimal feedback gains in the presence of structural constraints and/or sparsity-promoting penalty functions. Such problems are known to be difficult due to their lack of convexity. We provide an equivalent reformulation of the optimization problem such that its source of nonconvexity is isolated in one nonconvex matrix inequality of the form Y X -1. Furthermore, we preserve the feedback gain as an optimization variable in the reformulated problem. Via linearizations of the nonconvex constraint, we introduce an iterative algorithm that solves a semidefinite program at every stage and for which the nonconvex constraint is satisfied upon convergence. We elaborate on the modular nature of the proposed scheme and show that it can be used in a wide range of network control problems.

Original languageEnglish (US)
Title of host publication2014 American Control Conference, ACC 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2426-2431
Number of pages6
ISBN (Print)9781479932726
DOIs
StatePublished - Jan 1 2014
Event2014 American Control Conference, ACC 2014 - Portland, OR, United States
Duration: Jun 4 2014Jun 6 2014

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619

Other

Other2014 American Control Conference, ACC 2014
Country/TerritoryUnited States
CityPortland, OR
Period6/4/146/6/14

Keywords

  • Communication architecture
  • optimization
  • semidefinite programming
  • sequential convex programming
  • sparsity-promoting control
  • structural constraints

Fingerprint

Dive into the research topics of 'On the design of optimal structured and sparse feedback gains via sequential convex programming'. Together they form a unique fingerprint.

Cite this