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

@article{Goebel2020AUC,
  title={A unifying convex analysis and switching system approach to consensus with undirected communication graphs},
  author={Rafal Goebel and Ricardo G. Sanfelice},
  journal={Autom.},
  year={2020},
  volume={111}
}
  • Rafal Goebel, Ricardo G. Sanfelice
  • Published 2020
  • Mathematics, Computer Science
  • Autom.
  • 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 may be subject to constraints. Since the common minimizers may represent consensus in a multi-agent system modeled by an undirected communication graph, several known results about asymptotic consensus are deduced as… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 32 REFERENCES

    Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Distributed Continuous-Time Algorithm for Constrained Convex Optimizations via Nonsmooth Analysis Approach

    VIEW 1 EXCERPT

    Constrained Consensus and Optimization in Multi-Agent Networks

    VIEW 2 EXCERPTS

    Network Synchronization With Nonlinear Dynamics and Switching Interactions

    VIEW 3 EXCERPTS

    Asynchronous Consensus Protocols Using Nonlinear Paracontractions Theory

    Network Synchronization with Convexity

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    On Distributed Convex Optimization Under Inequality and Equality Constraints

    VIEW 1 EXCERPT

    Exact formation control with very coarse information

    VIEW 1 EXCERPT