On the optimal synchronization of oscillator networks via sparse interconnection graphs

Makan Fardad, Fu Lin, Mihailo R. Jovanovic

Research output: Chapter in Book/Entry/PoemConference contribution

9 Scopus citations


We study the optimal design of a conductance network as a means for synchronizing a given set of oscillators. By considering the conductance that connects two oscillators as the measure of the amount of communication between them, we formulate an optimal control problem that addresses the trade-off between synchronization performance and communication. Additionally, we promote the sparsity of the network by penalizing the number of interconnection links. For identical oscillators, we establish convexity and show that the design problem can be formulated as a semidefinite program. For non-identical oscillators, that can be considered as perturbations around a central (average) oscillator, we show that it is meaningful to design an optimal conductance network by assuming that all oscillators are identical to the central oscillator. Finally, for special classes of oscillator networks we derive explicit formulas for the optimal conductance values.

Original languageEnglish (US)
Title of host publication2012 American Control Conference, ACC 2012
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Print)9781457710957
StatePublished - 2012
Event2012 American Control Conference, ACC 2012 - Montreal, QC, Canada
Duration: Jun 27 2012Jun 29 2012

Publication series

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


Other2012 American Control Conference, ACC 2012
CityMontreal, QC


  • Convex relaxation
  • optimization
  • oscillator synchronization
  • semidefinite programming
  • sparse communication architecture

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'On the optimal synchronization of oscillator networks via sparse interconnection graphs'. Together they form a unique fingerprint.

Cite this