Approximate Projected Consensus for Convex Intersection Computation: Convergence Analysis and Critical Error Angle

Cited In (17)

Distributed resource allocation over random networks based on stochastic approximation
Distributed optimization for a class of uncertain nonlinear multi‐agent systems with arbitrary relative degree subject to exogenous disturbances
Distributed optimal coordination for multiple heterogeneous Euler-Lagrangian systems
Distributed continuous-time approximate projection protocols for shortest distance optimization problems
Distributed optimization with inexact oracle
Approximate representation of the Pareto frontier in multiparty negotiations: decentralized methods and privacy preservation
Distributed optimisation for resource allocation with event-triggered communication over general directed topology
Distributed regularized online optimization using forward-backward splitting
Optimal consensus for uncertain high‐order multi‐agent systems by output feedback
Distributed online bandit optimization under random quantization
Consensus control for linear systems with optimal energy cost
Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme
Distributed gradient algorithm for constrained optimization with application to load sharing in power systems
Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
On convergence rate of distributed stochastic gradient algorithm for convex optimization with inequality constraints
A distributed fixed-time optimization algorithm for multi-agent systems
Aggregation in intersection region for distributed heterogeneous mobile sensor networks

This page was built for publication: Approximate Projected Consensus for Convex Intersection Computation: Convergence Analysis and Critical Error Angle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983103)