91,991 Hits in 5.4 sec

2020 Index IEEE Transactions on Signal and Information Processing over Networks Vol. 6

2020 IEEE Transactions on Signal and Information Processing over Networks  
., +, TSIPN 2020 570-579 Distributed algorithms Computation-Efficient Distributed Algorithm for Convex Optimization Over Time-Varying Networks With Limited Bandwidth Communication.  ...  Merluzzi, M., +, TSIPN 2020 342-356 Equalizers Proof of the Equivalency of MSE-Constrained and Rate-Constrained Power Optimization Approaches to Distributed Bi-Directional Beamforming.  ... 
doi:10.1109/tsipn.2021.3050691 fatcat:fygxby3zrjbhjlid5odg4mdnf4

Distributed Relative Clock Synchronization for Wireless Sensor Networks

Iman Shames, Adrian N. Bishop
2011 IFAC Proceedings Volumes  
Later, we provide a distributed discrete-time solution to the same problem and show exponential convergence. Then we provide a similar algorithm for achieving the same solution in continuous-time.  ...  Both the discrete-time algorithm and the continuous-time algorithm are distributed in that each node in the network requires very little information from its neighbours in the network.  ...  We the introduced a number of distributed mechanisms for solving the stated constrained optimization algorithm.  ... 
doi:10.3182/20110828-6-it-1002.03685 fatcat:v6qltchwrzhzzj4fb7vvdy5yta

Periodic and event-triggered communication for distributed continuous-time convex optimization

Solmaz S. Kia, Jorge Cortes, Sonia Martinez
2014 2014 American Control Conference  
We propose a distributed continuous-time algorithm to solve a network optimization problem where the global cost function is a strictly convex function composed of the sum of the local cost functions of  ...  We establish that our algorithm, when implemented over strongly connected and weight-balanced directed graph topologies, converges exponentially fast when the local cost functions are strongly convex and  ...  ACKNOWLEDGMENTS This work was supported by L3 Communications through the UCSD Cymer Center for Control Systems and Dynamics and NSF Award ECCS-1307176.  ... 
doi:10.1109/acc.2014.6859122 dblp:conf/amcc/KiaCM14 fatcat:avbzs5zizjdj3oo7fwhyvrag5i

Distributed Constraint Optimization with Flocking Behavior

Zhengquan Yang, Qing Zhang, Zengqiang Chen
2018 Complexity  
This paper studies distributed optimization having flocking behavior and local constraint set. Multiagent systems with continuous-time and second-order dynamics are studied.  ...  First, a bounded potential function to construct the controller is given and a distributed optimization algorithm that makes a group of agents avoid collisions during the evolution is presented.  ...  Zhao [4] studied a distributed continuous-time optimization problem for general linear multiagent systems.  ... 
doi:10.1155/2018/1579865 fatcat:d4wbxa3sunahvkdh54mmbfnigm

A New Algorithm for Distributed Control Problem with Shortest-Distance Constraints

Yu Zhou, Wenfeng Zheng, Zhixi Shen
2016 Mathematical Problems in Engineering  
This paper investigates the distributed shortest-distance problem of multiagent systems where agents satisfy the same continuous-time dynamics.  ...  The simulation example shows that the distributed shortest-distance consensus algorithm is effective for our theoretical results.  ...  In [13] , Wang and Elia proposed a distributed continuous-time algorithm to achieve optimization by controlling the sum of subgradients of convex functions.  ... 
doi:10.1155/2016/1604824 fatcat:xuhcmz25undt7jejumva7rfcsu

Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets

Guodong Shi, Karl Henrik Johansson, Yiguang Hong
2013 IEEE Transactions on Automatic Control  
By a simple distributed control rule, the considered multi-agent system with continuous-time dynamics achieves not only a consensus, but also an optimal agreement within the optimal solution set of the  ...  In this way, the corresponding intersection computation problem is solved by the proposed decentralized continuous-time algorithm.  ...  ACKNOWLEDGMENT The authors would like to thank the Associate Editor and the anonymous reviewers for their valuable suggestions.  ... 
doi:10.1109/tac.2012.2215261 fatcat:zsejmsffvjc2vmibbtakurswsy

Distributed Nonconvex Multiagent Optimization Over Time-Varying Networks [article]

Ying Sun, Gesualdo Scutari, Daniel Palomar
2016 arXiv   pre-print
To the best of our knowledge, the proposed framework is the first broadcast-based distributed algorithm for convex and nonconvex constrained optimization over arbitrary, time-varying digraphs.  ...  We introduce a novel broadcast-based distributed algorithmic framework for the (constrained) minimization of the sum of a smooth (possibly nonconvex and nonseparable) function, i.e., the agents' sum-utility  ...  CONCLUSION In this paper we have proposed (ATC/CTA-)SONATA, a family of novel distributed algorithms for nonconvex constrained optimization over time-varying (directed) networks.  ... 
arXiv:1607.00249v3 fatcat:rfgux3qnkzff3h6tor5ntjb7au

Task Allocation for Distributed Stream Processing [article]

Raphael Eidenbenz, Thomas Locher
2016 arXiv   pre-print
Furthermore, we propose an approximation algorithm for the class of series-parallel decomposable graphs, which captures a broad range of common stream processing applications.  ...  In order to ensure the timely and reliable processing of streaming data, a variety of distributed stream processing architectures and platforms have been developed, which handle the fundamental tasks of  ...  While this problem is NP-hard for general graphs [26] , Finta et al. present an algorithm that computes an optimal schedule for a class of series-parallel graphs in quadratic time [27] .  ... 
arXiv:1601.06060v1 fatcat:aizxfpqtnvh6lmecmx6jlzsvse

Optimization for Data-Driven Learning and Control

Usman A. Khan, Waheed U. Bajwa, Angelia Nedic, Michael G. Rabbat, Ali H. Sayed
2020 Proceedings of the IEEE  
A general framework for distributed firstorder methods over undirected and directed graphs is presented, together with its stochastic variants that rely on stochastic gradient evaluations at each node  ...  For real-time multi-robot path planning, recent approaches based on approximately solving distributed optimization problems are discussed for both continuous-and discrete-action domains.  ... 
doi:10.1109/jproc.2020.3031225 fatcat:6ibimo2s2zgepbyeya2fjq7flu

SHERPA: A SDN Multipath Approach to Eliminate Resilience Impact on Video Streams

Constant Colombo, Francis Lepage, Rene Kopp, Eric Gnaedinger
2018 2018 IEEE 18th International Conference on Communication Technology (ICCT)  
The produced graph is called Residual Graph. 4: Using a delay constrained shortest path algorithm, a path P 2 from s to t is found in this new graph. 5: Edges that exists in opposite directions in P 1  ...  This algorithm is intended for graphs that are not fully meshed. As not many paths may exist, this loss in optimality will often not be observed.  ... 
doi:10.1109/icct.2018.8600180 fatcat:fogcx2ta2ja4tea65arqvqesmm

Event-Triggered Discrete-Time Distributed Consensus Optimization over Time-Varying Graphs

Qingguo Lü, Huaqing Li
2017 Complexity  
This paper focuses on a class of event-triggered discrete-time distributed consensus optimization algorithms, with a set of agents whose communication topology is depicted by a sequence of time-varying  ...  Under the assumption that the network topology is uniformly strongly connected and weight-balanced, the novel event-triggered distributed subgradient algorithm is capable of steering the whole network  ...  Conclusion and Future Work In this paper, a novel consensus-based event-triggered algorithm for solving the distributed convex optimization problem over time-varying directed networks has been analyzed  ... 
doi:10.1155/2017/5385708 fatcat:pqusujozc5fy7abrim52222pqm

Two SDN Multi-tree Approaches for Constrained Seamless Multicast

Constant Colombo, Francis Lepage, Rene Kopp, Eric Gnaedinger
2018 2018 IEEE International Conference on Computational Science and Engineering (CSE)  
Any failure on the network causes a recovery time implying loss and an impact in the content viewing. This illustrate that service continuity is a direct consequence of network availability.  ...  Two maximally independent trees carrying the same stream over the network are deployed.  ...  [16] , [17] , [18] intended to provide a new algorithm, based on directed graphs and resulting in a close to optimal solution.  ... 
doi:10.1109/cse.2018.00017 dblp:conf/cse/ColomboLKG18 fatcat:f6ppymce3zg7fh2z62voccy6eq

Optimal multicast routing with quality of service constraints

Vachaspathi P. Kompella, Joseph C. Pasquale, George C. Polyzos
1996 Journal of Network and Systems Management  
We concentrate on distributed algorithms for determining a tree over the network topology, rooted at the source and spanning the intended destinations.  ...  We consider the problem of optimal multicast routing with Quality of Service constraints motivated by the requirements of interactive continuous media communication, e.g., real-time teleconferencing.  ...  ACKNOWLEDGMENTS The authors would like to thank the reviewers for their comments and especially for pointing out a flaw in a previous version of the cycle make-and-break procedure.  ... 
doi:10.1007/bf02139130 fatcat:jfcgdyoemnb2rhpoxvpsvq2gaq

Distributed Stochastic Subgradient Projection Algorithms Based on Weight-Balancing over Time-Varying Directed Graphs

Junlong Zhu, Ping Xie, Mingchuan Zhang, Ruijuan Zheng, Ling Xing, Qingtao Wu
2019 Complexity  
We consider a distributed constrained optimization problem over graphs, where cost function of each agent is private. Moreover, we assume that the graphs are time-varying and directed.  ...  In order to address such problem, a fully decentralized stochastic subgradient projection algorithm is proposed over time-varying directed graphs.  ...  In addition, 2 Complexity [26] considers a continuous-time optimization algorithm over underlying time-varying directed networks.  ... 
doi:10.1155/2019/8030792 fatcat:sb4xn5di7feolj7wq25v32f67i

Scalable Causal Structure Learning: New Opportunities in Biomedicine [article]

Pulakesh Upadhyaya, Kai Zhang, Can Li, Xiaoqian Jiang, Yejin Kim
2021 arXiv   pre-print
We review prominent traditional, score-based and machine-learning based schemes for causal structure discovery, study some of their performance over some benchmark datasets, and discuss some of the applications  ...  Causal Structure Discovery: Continuous Space Algorithms The traditional discovery algorithms try to discover a causal graph (which is usually a directed acyclic graph (DAG) while searching for the optimal  ...  ) "DAG-ness" of the graph with adjacency matrix A ( =0 for ℎ( ) DAG), and optimizes using continuous optimization.  ... 
arXiv:2110.07785v1 fatcat:3dk2kfkvzjdqhazuenuhvg5f7e
« Previous Showing results 1 — 15 out of 91,991 results