An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization
From MaRDI portal
Publication:5353240
DOI10.1109/TAC.2012.2228038zbMath1369.90140arXiv1010.2732OpenAlexW2101876299MaRDI QIDQ5353240
Publication date: 8 September 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.2732
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (12)
Distributed Linear Programming with Event-Triggered Communication ⋮ A consensus algorithm based on collective neurodynamic system for distributed optimization with linear and bound constraints ⋮ A gradient‐free distributed optimization method for convex sum of nonconvex cost functions ⋮ Distributed nonconvex constrained optimization over time-varying digraphs ⋮ Fixed-time consensus for multi-agent systems with objective optimization on directed detail-balanced networks ⋮ Distributed robust adaptive equilibrium computation for generalized convex games ⋮ Distributed fixed-time optimization for multi-agent systems over a directed network ⋮ Fixed‐time distributed optimization for multi‐agent systems with external disturbances over directed networks ⋮ Second-Order Guarantees of Distributed Gradient Algorithms ⋮ Distributed constraint optimization on networked multi-agent systems ⋮ Measurement-based efficient resource allocation with demand-side adjustments ⋮ A new algorithm for distributed control problem with shortest-distance constraints
This page was built for publication: An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization
