Distributed Abstract Optimization via Constraints Consensus: Theory and Applications

Details Distributed Abstract Optimization via Constraints Consensus: Theory and Applications Distributed Abstract Optimization via Constraints Consensus: Theory and Applications

2009-10-30

arxiv.org/abs/0910.5816v2

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Distributed Abstract Optimization via Constraints Consensus: Theory and Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distributed Abstract Optimization via Constraints Consensus: Theory and Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Abstract Optimization via Constraints Consensus: Theory and Applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-89386