Distributed Abstract Optimization via Constraints Consensus: Theory and Applications

DOI10.1109/TAC.2011.2164020MaRDI QIDQ5347859zbMATH OpenFDO

Authors Francesco Bullo, Giuseppe Notarstefano

Publication date 25 August 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Abstract: Distributed abstract programs are a novel class of distributed optimization problems where (i) the number of variables is much smaller than the number of constraints and (ii) each constraint is associated to a network node. Abstract optimization programs are a generalization of linear programs that captures numerous geometric optimization problems. We propose novel constraints consensus algorithms for distributed abstract programs: as each node iteratively identifies locally active constraints and exchanges them with its neighbors, the network computes the active constraints determining the global optimum. The proposed algorithms are appropriate for networks with weak time-dependent connectivity requirements and tight memory constraints. We show how suitable target localization and formation control problems can be tackled via constraints consensus.

Cited in

(12)

• A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
• Consensus-based distributed fixed-time optimization for a class of resource allocation problems
• Distributed set-membership filtering for time-varying systems: a coding-decoding-based approach
• Distributed convex optimization algorithms and their application to distributed control in peer-to-peer data storage system
• Optimal control applications and methods literature survey (No. 27)
• Constrained distributed optimization: a population dynamics approach
• Containment control of multi-agent systems by exploiting the control inputs of neighbors
• On the optimal parameter of the composite Laplacian quadratics function
• Concurrent forward bounding for distributed constraint optimization problems
• scientific article; zbMATH DE number 1301749 (Why is no real title available?)
• Trends in Consensus-Based Optimization
• Networked Systems Theory: Distributed Algorithms for Optimal Cooperation of Dynamical Systems

This page was built for publication: Distributed Abstract Optimization via Constraints Consensus: Theory and Applications

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