Distributed control over networks using smoothing techniques

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we propose two dual decomposition methods based on smoothing techniques, called here the proximal center method and the interior-point Lagrangian method, to solve distributively separable convex problems. We show that some relevant centralized control problems can be recast as a separable convex problem for which our dual methods can be applied. The new dual optimization methods are suitable for application to distributed control since they are highly parallelizable, each subsystem uses local information and the coordination between the local controllers is performed via the Lagrange multipliers corresponding to the coupled dynamics or constraints. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Necoara, I. (2009). Distributed control over networks using smoothing techniques. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5769 LNCS, pp. 835–844). https://doi.org/10.1007/978-3-642-04277-5_84

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free