Constrained Consensus and Optimization in Multi-Agent Networks
From MaRDI portal
Publication:4978779
DOI10.1109/TAC.2010.2041686zbMATH Open1368.90143arXiv0802.3922MaRDI QIDQ4978779FDOQ4978779
Authors: Angelia Nedić, Asuman Ozdaglar, Pablo A. Parrilo 
Publication date: 25 August 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Abstract: We present distributed algorithms that can be used by multiple agents to align their estimates with a particular value over a network with time-varying connectivity. Our framework is general in that this value can represent a consensus value among multiple agents or an optimal solution of an optimization problem, where the global objective function is a combination of local agent objective functions. Our main focus is on constrained problems where the estimate of each agent is restricted to lie in a different constraint set. To highlight the effects of constraints, we first consider a constrained consensus problem and present a distributed ``projected consensus algorithm in which agents combine their local averaging operation with projection on their individual constraint sets. This algorithm can be viewed as a version of an alternating projection method with weights that are varying over time and across agents. We establish convergence and convergence rate results for the projected consensus algorithm. We next study a constrained optimization problem for optimizing the sum of local objective functions of the agents subject to the intersection of their local constraint sets. We present a distributed ``projected subgradient algorithm which involves each agent performing a local averaging operation, taking a subgradient step to minimize its own objective function, and projecting on its constraint set. We show that, with an appropriately selected stepsize rule, the agent estimates generated by this algorithm converge to the same optimal solution for the cases when the weights are constant and equal, and when the weights are time-varying but all agents have the same constraint set.
Full work available at URL: https://arxiv.org/abs/0802.3922
Cited In (only showing first 100 items - show all)
- Graph Lyapunov function for switching stabilization and distributed computation
- Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing
- Distributed constraint optimization with flocking behavior
- Neural adaptive sliding-mode control of a bidirectional vehicle platoon with velocity constraints and input saturation
- Asynchronous gossip-based gradient-free method for multiagent optimization
- Distributed optimization of multiagent systems in directed networks with time-varying delay
- Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks
- Online distributed design for control cost reduction
- Distributed constrained optimization for multi-agent networks with nonsmooth objective functions
- Distributed constraint optimization on networked multi-agent systems
- Distributed stochastic nonsmooth nonconvex optimization
- Distributed nonconvex constrained optimization over time-varying digraphs
- Distributed continuous-time algorithms for nonsmooth extended monotropic optimization problems
- Predictive consensus for networked multi-agent systems with switching topology and variable delay
- An Arrow-Hurwicz-Uzawa type flow as least squares solver for network linear equations
- Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs
- Distributed optimization over directed graphs with row stochasticity and constraint regularity
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
- Improved mixing rates of directed cycles by added connection
- Global optimal consensus for multi-agent systems with bounded controls
- Augmented Lagrange algorithms for distributed optimization over multi-agent networks via edge-based method
- Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs
- Consensus and balancing on the three-sphere
- Distributed subgradient method for multi-agent optimization with quantized communication
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- Asynchronous algorithms for computing equilibrium prices in a capital asset pricing model
- Consensus for heterogeneous multi-agent systems with nonconvex input constraints and nonuniform time delays
- Distributed stochastic gradient tracking methods
- Partition-based multi-agent optimization in the presence of lossy and asynchronous communication
- An overview on game theory applications to engineering
- Reach almost sure consensus via \(L_p\)-norm group information
- Distributed \(H_\infty\) constrained consensus problem
- Distributed multi-UAV trajectory optimization over directed networks
- Consensus in asynchronous multiagent systems. I: Asynchronous consensus models
- Distributed heterogeneous multi-agent networks optimization with nonconvex velocity constraints
- Distributed semi-supervised support vector machines
- A new algorithm for distributed control problem with shortest-distance constraints
- Stochastic mirror descent method for distributed multi-agent optimization
- Distributed online bandit optimization under random quantization
- Discussion on: ``A decomposition algorithm for KYP-SDPs
- On the stability and convergence of a class of consensus systems with a nonlinear input
- Consensus control for linear systems with optimal energy cost
- Distributed extremum-seeking control over networks of dynamically coupled unstable dynamic agents
- Dynamic average consensus via nonlinear protocols
- Convergence rate analysis of distributed optimization with projected subgradient algorithm
- Exponential convergence of a distributed algorithm for solving linear algebraic equations
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks
- Aggregation in intersection region for distributed heterogeneous mobile sensor networks
- Continuous distributed algorithms for solving linear equations in finite time
- Doubly stochastic pairwise interactions for agreement and alignment
- Distributed optimization with hybrid linear constraints for multi‐agent networks
- Distributed fixed-time optimization for multi-agent systems over a directed network
- Distributed constrained optimization via continuous-time mirror design
- Distributed optimization with closed convex set for multi-agent networks over directed graphs
- Implementing the alternating direction method of multipliers for big datasets: a case study of least absolute shrinkage and selection operator
- A governor approach for consensus of heterogeneous systems with constraints under a switching network
- Competitive equilibriums and social shaping for multi-agent systems
- Distributed least squares solver for network linear equations
- Triggered gradient tracking for asynchronous distributed optimization
- Network flows that solve least squares for linear equations
- Practical consensus for heterophilous multiagent networks with constrained states
- Suboptimal output consensus of a group of discrete-time heterogeneous linear non-minimum phase systems
- Distributed optimization without boundedness of gradients for second-order multi-agent systems over unbalanced network
- Differentially private distributed optimization for multi-agent systems via the augmented Lagrangian algorithm
- Suboptimal output consensus for a group of weakly nonminimum phase linear systems
- Constrained consensus of continuous-time heterogeneous multi-agent networks with nonconvex constraints and delays
- Distributed proximal‐gradient algorithms for nonsmooth convex optimization of second‐order multiagent systems
- Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate.
- Distributed ergodic algorithms for mixed equilibrium problems: absent of cut property
- Distributed system identification for linear stochastic systems with binary sensors
- Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
- Strong consistency of random gradient-free algorithms for distributed optimization
- A distributed algorithm for solving mixed equilibrium problems
- Distributed stochastic approximation with local projections
- Multi-cluster distributed optimization via random sleep strategy
- A second-order accelerated neurodynamic approach for distributed convex optimization
- Augmented Lagrangian tracking for distributed optimization with equality and inequality coupling constraints
- Distributed dynamic event-triggered and practical predefined-time resource allocation in cyber-physical systems
- Containment control with input and velocity constraints
- Position-constrained containment for second-order discrete-time multi-agent systems
- Mass-spring-damper networks for distributed optimization in non-Euclidean spaces
- Distributed adaptive optimization for generalized linear multiagent systems
- Observer based switching ILC for consensus of nonlinear nonaffine multi-agent systems
- Decentralized dictionary learning over time-varying digraphs
- A consensus algorithm based on collective neurodynamic system for distributed optimization with linear and bound constraints
- A unitary distributed subgradient method for multi-agent optimization with different coupling sources
- Heterogeneous linear multi-agent consensus with nonconvex input constraints and switching graphs
- Distributed decision-coupled constrained optimization via proximal-tracking
- Cooperative convex optimization with subgradient delays using push-sum distributed dual averaging
- Title not available (Why is that?)
- Distributed optimization of multi-integrator agent systems with mixed neighbor interactions
- Distributed stochastic subgradient projection algorithms based on weight-balancing over time-varying directed graphs
- Tracking-ADMM for distributed constraint-coupled optimization
- Improving the convergence of distributed gradient descent via inexact average consensus
- Algorithm implementation for distributed convex intersection computation
- Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs
- \(\mathcal{H}_\infty\) network optimization for edge consensus
- Resilient consensus in multi-agent systems with state constraints
- Network synchronization with convexity
This page was built for publication: Constrained Consensus and Optimization in Multi-Agent Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4978779)
