Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Moradian, Hossein"'
In this letter, we study the problem of accelerating reaching average consensus over connected graphs in a discrete-time communication setting. Literature has shown that consensus algorithms can be accelerated by increasing the graph connectivity or
Externí odkaz:
http://arxiv.org/abs/2211.05959
In this letter, we study the problem of accelerating reaching average consensus over connected graphs in a discrete-time communication setting. Literature has shown that consensus algorithms can be accelerated by increasing the graph connectivity or
Externí odkaz:
http://arxiv.org/abs/2206.09916
Autor:
Moradian, Hossein, Kia, Solmaz S.
We propose a continuous-time second-order optimization algorithm for solving unconstrained convex optimization problems with bounded Hessian. We show that this alternative algorithm has a comparable convergence rate to that of the continuous-time New
Externí odkaz:
http://arxiv.org/abs/2105.09443
Autor:
Moradian, Hossein, Kia, Solmaz S.
In this paper, we study accelerating a Laplacian-based dynamic average consensus algorithm by splitting the conventional delay-free disagreement feedback into weighted summation of a current and an outdated term. We determine for what weighted sum th
Externí odkaz:
http://arxiv.org/abs/1912.04442
Autor:
Moradian, Hossein, Kia, Solmaz S.
We propose a distributed solution for a constrained convex optimization problem over a network of clustered agents each consisted of a set of subagents. The communication range of the clustered agents is such that they can form a connected undirected
Externí odkaz:
http://arxiv.org/abs/1908.06634
On the Positive Effect of Delay on the Rate of Convergence of a Class of Linear Time-Delayed Systems
Autor:
Moradian, Hossein, Kia, Solmaz S.
This paper is a comprehensive study of a long observed phenomenon of increase in the stability margin and so the rate of convergence of a class of linear systems due to time delay. We use Lambert W function to determine (a) in what systems the delay
Externí odkaz:
http://arxiv.org/abs/1812.04030
Autor:
Moradian, Hossein, Kia, Solmaz S.
This paper studies the robustness of a dynamic average consensus algorithm to communication delay over strongly connected and weight-balanced (SCWB) digraphs. Under delay-free communication, the algorithm of interest achieves a practical asymptotic t
Externí odkaz:
http://arxiv.org/abs/1805.07456
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Microelectronics Reliability August 2016 63:256-266
