Conservative Signal Processing Architectures For Asynchronous, Distributed Optimization Part I: General Framework

This paper presents a framework for designing a class of distributed, asynchronous optimization algorithms, realized as signal processing architectures utilizing various conservation principles. The architectures are specifically based on stationarity conditions pertaining to primal and dual variabl...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:arXiv.org
Hlavní autoři: Baran, Thomas A, Lahlou, Tarek A
Médium: Paper
Jazyk:angličtina
Vydáno: Ithaca Cornell University Library, arXiv.org 17.10.2014
Témata:
Algorithms
Computer networks
Electrical networks
Optimization
Optimization algorithms
Signal processing
Superposition (mathematics)
ISSN:2331-8422
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í:This paper presents a framework for designing a class of distributed, asynchronous optimization algorithms, realized as signal processing architectures utilizing various conservation principles. The architectures are specifically based on stationarity conditions pertaining to primal and dual variables in a class of generally nonconvex optimization problems. The stationarity conditions, which are closely related to the principles of stationary content and co-content that can be derived using Tellegen's theorem in electrical networks, are in particular transformed via a linear change of coordinates to obtain a set of linear and nonlinear maps that form the basis for implementation. The resulting algorithms specifically operate by processing a linear superposition of primal and dual decision variables using the associated maps, coupled using synchronous or asynchronous delay elements to form a distributed system. A table is provided containing specific example elements that can be assembled to form various optimization algorithms directly from the corresponding problem statements.
Bibliografie:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2331-8422
DOI:10.48550/arxiv.1407.0418