A distributed methodology for approximate uniform global minimum sharing
From MaRDI portal
Publication:2665417
Abstract: The paper deals with the distributed minimum sharing problem: a set of decision-makers compute the minimum of some local quantities of interest in a distributed and decentralized way by exchanging information through a communication network. We propose an adjustable approximate solution which enjoys several properties of crucial importance in applications. In particular, the proposed solution has good decentralization properties and it is scalable in that the number of local variables does not grow with the size or topology of the communication network. Moreover, a global and uniform (both in the initial time and in the initial conditions) asymptotic stability result is provided towards a steady state which can be made arbitrarily close to the sought minimum. Exact asymptotic convergence can be recovered at the price of losing uniformity with respect to the initial time.
Recommendations
- Approximations in Distributed Optimization
- A distributed ADMM-like method for resource sharing over time-varying networks
- Distributed stochastic algorithm for global optimization in networked system
- Distributed stochastic approximation with local projections
- Distributed average consensus with least-mean-square deviation
Cites work
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization
- A Proximal Gradient Algorithm for Decentralized Composite Optimization
- A Stochastic Approximation Method
- A unified framework for input-to-state stability in systems with two time scales
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- ADD-OPT: Accelerated Distributed Directed Optimization
- Analysis for a class of singularly perturbed hybrid systems via averaging
- Analysis of Max-Consensus Algorithms in Wireless Channels
- Constrained Consensus and Optimization in Multi-Agent Networks
- Convergence analysis of max-consensus algorithm in probabilistic communication networks with Bernoulli dropouts
- Convergence Rate of Distributed ADMM Over Networks
- D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
- Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
- Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
- Distributed Convex Optimization with Inequality Constraints over Time-Varying Unbalanced Digraphs
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Distributed Subgradient Methods for Convex Optimization Over Random Networks
- Distributed Subgradient Methods for Multi-Agent Optimization
- DLM: Decentralized Linearized Alternating Direction Method of Multipliers
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Harnessing Smoothness to Accelerate Distributed Optimization
- scientific article; zbMATH DE number 1043533 (Why is no real title available?)
- scientific article; zbMATH DE number 1376974 (Why is no real title available?)
- Hybrid dynamical systems. Modeling, stability, and robustness
- Linear Convergence Rate of a Class of Distributed Augmented Lagrangian Algorithms
- Network Newton Distributed Optimization Methods
- Newton-Raphson Consensus for Distributed Convex Optimization
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- On non-local stability properties of extremum seeking control
- On the convergence of decentralized gradient descent
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Primal recovery from consensus-based dual decomposition for distributed convex optimization
- Real‐Time Optimization by Extremum‐Seeking Control
This page was built for publication: A distributed methodology for approximate uniform global minimum sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2665417)
