Mr. Yang Liu

From 2015 to now, I have been working as a PhD candidate in the Australian National University, Australia. I received the bachelor degree from the Department of Microeletronics, Tsinghua University, China in 2015.

Distributed computation and optimization, network control, multi-agent systems.

Conference papers:

Liu, Y., Lageman, C., Anderson, B.D. and Shi, G., 2017. Exponential least squares solvers for linear equations over networks. IFAC-PapersOnLine50(1), pp.2543-2548.

Liu, Y., Lou, Y., Anderson, B.D. and Shi, G., 2017, December. Network flows as least squares solvers for linear equations. In Decision and Control (CDC), 2017 IEEE 56th Annual Conference on (pp. 1046-1051).

Liu, Y., Wu, J., Manchester, I. R. and Shi, G., 2018, December. Gossip algorithms that preserve privacy for distributed computation Part I: The algorithm and convergence condition. In Decision and Control (CDC), 2018 IEEE 57th Annual Conference on.

Liu, Y., Wu, J., Manchester, I. R. and Shi, G., 2018, December. Gossip algorithms that preserve privacy for distributed computation Part II: Performance against eavesdroppers. In Decision and Control (CDC), 2018 IEEE 57th Annual Conference on.

 

Journal papers:

Liu, Y., Lageman, C., Anderson, B.D. and Shi, G., 2018. An Arrow-Hurwicz-Uzawa type flow as least squares solver for network linear equations. Automatica 100, 187-193.

Liu, Y., Lou, Y., Anderson, B.D. and Shi, G., 2018, Network flows as least squares solvers for linear equations. Automatica. (Under review).

Liu, Y., Li, B., Anderson, B.D. and Shi, G., 2018, Clique gossiping. IEEE/ACM Transactions on Networking. (Under review).

Liu, Y., Wu, J., Manchester, I. R. and Shi, G., 2018, Privacy-preserving gossip algorithms. IEEE/ACM Transactions on Networking. (Under review).

Updated:  1 November 2018/Responsible Officer:  Dean, CECS/Page Contact:  CECS Marketing