A unifying convex analysis and switching system approach to consensus with undirected communication graphs

Switching between finitely many continuous-time autonomous steepest descent dynamics for convex functions is considered. Convergence of complete solutions to common minimizers of the convex functions, if such minimizers exist, is shown. The convex functions need not be smooth and the dynamics may be...

Full description

Saved in:
Bibliographic Details
Published inAutomatica (Oxford) Vol. 111; p. 108598
Main Authors Goebel, Rafal, Sanfelice, Ricardo G.
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.01.2020
Subjects
Online AccessGet full text

Cover

Loading…