76 citations · 119 across the 16 of their papers we have counts for
4 papers · 1 filter
Distributed Stochastic Block Coordinate Descent for Time-Varying Multi-Agent Optimization
Zhan Yu, Daniel W. C. Ho
In this paper, a class of large-scale distributed nonsmooth convex optimization problem over time-varying multi-agent network is investigated. Specifically, the decision space whic…
A New Approach to Pinning Control of Boolean Networks
Jie Zhong, Daniel W. C. Ho, Jianquan Lu
Boolean networks (BNs) are discrete-time systems where nodes are inter-connected (here we call such connection rule among nodes as network structure), and the dynamics of each gene…
Zeroth-Order Stochastic Block Coordinate Type Methods for Nonconvex Optimization
Zhan Yu, Daniel W. C. Ho
We study (constrained) nonconvex (composite) optimization problems where the decision variables vector can be split into blocks of variables. Random block projection is a popular t…
Distributed Randomized Gradient-Free Mirror Descent Algorithm for Constrained Optimization
Zhan Yu, Daniel W. C. Ho, Deming Yuan
This paper is concerned with multi-agent optimization problem. A distributed randomized gradient-free mirror descent (DRGFMD) method is developed by introducing a randomized gradie…