Distributed continuous-time approximate projection protocols for shortest distance optimization problems

DOI10.1016/J.AUTOMATICA.2016.02.019zbMath1338.93026arXiv1503.04904OpenAlexW2963074062MaRDI QIDQ286313

Youcheng Lou, Yiguang Hong, Shou-Yang Wang

Publication date: 20 May 2016

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.04904

zbMATH Keywords

distributed optimizationapproximate projectionconvex intersectionshortest distance optimization

Mathematics Subject Classification ID

Applications of optimal control and differential games (49N90) Decentralized systems (93A14) Agent technology and artificial intelligence (68T42)

Related Items (12)

Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation ⋮ Distributed continuous-time algorithm for nonsmooth optimal consensus without sharing local decision variables ⋮ Distributed optimization with hybrid linear constraints for multi‐agent networks ⋮ Distributed resource allocation of second‐order nonlinear multiagent systems ⋮ Distributed formation-aggregation control algorithm for a cluster of quadrotors ⋮ Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators ⋮ Distributed constrained optimization via continuous-time mirror design ⋮ Adaptive distributed convex optimization for multi-agent and its application in flocking behavior ⋮ Distributed consensus-based \(K\)-means algorithm in switching multi-agent networks ⋮ Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity ⋮ Distributed optimization of general linear multi-agent systems with external disturbance ⋮ A multi-scale method for distributed convex optimization with constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed convergence to Nash equilibria in two-network zero-sum games
• Handbook of global optimization. Vol. 2
• Randomized optimal consensus of multi-agent systems
• Convergence of random sleep algorithms for optimal consensus
• Robust Consensus for Continuous-Time Multiagent Dynamics
• Approximate Projected Consensus for Convex Intersection Computation: Convergence Analysis and Critical Error Angle
• Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
• A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
• Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
• Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication
• Distributed Subgradient Methods for Multi-Agent Optimization
• Constrained Consensus and Optimization in Multi-Agent Networks
• Gossip Algorithms for Convex Consensus Optimization Over Networks
• Zero-Gradient-Sum Algorithms for Distributed Convex Optimization: The Continuous-Time Case
• Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets
• The Theory of Max-Min, with Applications
• The method of projections for finding the common point of convex sets
• State Constraints in Convex Control Problems of Bolza

This page was built for publication: Distributed continuous-time approximate projection protocols for shortest distance optimization problems