Decentralized consensus optimization with asynchrony and delays
Related publications (91)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We propose ODPOP, a new distributed algorithm for \textit{open multiagent combinatorial optimization} \cite{Faltings2005c}. The ODOP algorithm explores the same search space as the dynamic programming algorithm DPOP~\cite{Petcu2005} or the AND/OR search al ...
We consider the problem of detecting and locating buried land mines and subsurface objects by using a maneuvering array that receives scattered seismic surface waves. We demonstrate an adaptive system that moves an array of receivers according to an optima ...
Institute of Electrical and Electronics Engineers2007
We address the problem of tomogram reconstruction in frequency-domain optical-coherence tomography. We propose a new technique for suppressing the autocorrelation artifacts that are commonly encountered with the conventional Fourier-transform-based approac ...
We present two variants of Moler and Stewart's algorithm for reducing a matrix pair to Hessenberg-triangular (HT) form with increased data locality in the access to the matrices. In one of these variants, a careful reorganization and accumulation of Givens ...
For accurate a posteriori error analysis of the reduced basis method for coercive and non-coercive problems, a critical ingredient lies in the evaluation of a lower bound for the coercivity or inf-sup constant. In this short Note, we generalize and improve ...
In this work, we propose a new grid conversion algorithm between the hexagonal lattice and the orthogonal (a.k.a. Cartesian) lattice. The conversion process, named H2 O, is easy to implement and is perfectly reversible using the same algorithm to ...
This paper describes new optimization strategies that offer significant improvements in performance over existing methods for bridge-truss design. In this study, a real-world cost function that consists of costs on the weight of the truss and the number of ...
A novel algorithm is introduced for estimating the echo path responses for stereophonic acoustic echo cancellation. When the Wiener solution for the echo path responses is non-unique, the echo paths are estimated in two stages. In a first stage, one of the ...
The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a security module. The security modules trust each other but can only communicate by exch ...
Recent advances in process synthesis, design, operations, and control have created an increasing demand for efficient numerical algorithms for optimizing a dynamic system coupled with discrete decisions; these problems are termed mixed-integer dynamic opti ...