An extension of the method of multipliers for distributed nonlinear programming

In this paper we consider a distributed optimization problem, where a set of agents interacting through a communication graph have as common goal the minimization of a function expressed as a sum of (possibly non-convex) differentiable functions. Each function in the sum corresponds to an agent and...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:53rd IEEE Conference on Decision and Control s. 6951 - 6956
Hlavní autoři: Matei, Ion, Baras, John S., Nabi, Marzieh, Kurtoglu, Tolga
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.12.2014
Témata:
Algorithm design and analysis
Convergence
Distributed algorithms
Jacobian matrices
Optimization
Vectors
ISBN:9781479977468, 1479977462
ISSN:0191-2216
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper we consider a distributed optimization problem, where a set of agents interacting through a communication graph have as common goal the minimization of a function expressed as a sum of (possibly non-convex) differentiable functions. Each function in the sum corresponds to an agent and each agent has associated an equality constraint. In this paper we investigate how the standard method of multipliers can be used to solve an optimization problem with equality constraints in a distributed manner. The method of multipliers is applied to a lifted optimization problem whose solution embeds the solution of the original problem.We modify the standard convergence results to deal with the fact the (local) minimizers of the lifted optimization problem are not regular, as a results of the distributed formulation.
ISBN:9781479977468
1479977462
ISSN:0191-2216
DOI:10.1109/CDC.2014.7040481