Duality Codes and the Integrality Gap Bound for Index Coding. - Hao Yu 002; Michael J. Neely (IEEE Trans. Inf. Theory, 2014)

On the convergence time of the drift-plus-penalty algorithm for strongly convex programs. - Hao Yu 002; Michael J. Neely (CDC, 2015)

A primal-dual type algorithm with the O(1/t) convergence rate for large scale constrained convex programs. - Hao Yu 002; Michael J. Neely (CDC, 2016)

Dynamic power allocation in MIMO fading systems without channel distribution information. - Hao Yu 002; Michael J. Neely (INFOCOM, 2016)

A Low Complexity Algorithm with $O( sqrt{T})$ Regret and Finite Constraint Violations for Online Convex Optimization with Long Term Constraints. - Hao Yu 002; Michael J. Neely (CoRR, 2016)

Online Convex Optimization with Stochastic Constraints. - Hao Yu 002; Michael J. Neely; Xiaohan Wei (NIPS, 2017)

A Simple Parallel Algorithm with an O(1/t) Convergence Rate for General Convex Programs. - Hao Yu 002; Michael J. Neely (SIAM J. Optim., 2017)

Dynamic Transmit Covariance Design in MIMO Fading Systems With Unknown Channel Distributions and Inaccurate Channel State Information. - Hao Yu 002; Michael J. Neely (IEEE Trans. Wirel. Commun., 2017)

Solving Non-smooth Constrained Programs with Lower Complexity than mathcal{O}(1/ varepsilon): A Primal-Dual Homotopy Smoothing Approach. - Xiaohan Wei; Hao Yu 002; Qing Ling; Michael J. Neely (NeurIPS, 2018)

Solving Non-smooth Constrained Programs with Lower Complexity than 𝒪(1/ε): A Primal-Dual Homotopy Smoothing Approach. - Xiaohan Wei; Hao Yu 002; Qing Ling; Michael J. Neely (CoRR, 2018)

Online Learning in Weakly Coupled Markov Decision Processes: A Convergence Time Study. - Xiaohan Wei; Hao Yu 002; Michael J. Neely (Proc. ACM Meas. Anal. Comput. Syst., 2018)

On the Convergence Time of Dual Subgradient Methods for Strongly Convex Programs. - Hao Yu 002; Michael J. Neely (IEEE Trans. Autom. Control., 2018)

A New Backpressure Algorithm for Joint Rate Control and Routing With Vanishing Utility Optimality Gaps and Finite Queue Lengths. - Hao Yu 002; Michael J. Neely (IEEE/ACM Trans. Netw., 2018)

Learning-Aided Optimization for Energy-Harvesting Devices With Outdated State Information. - Hao Yu 002; Michael J. Neely (IEEE/ACM Trans. Netw., 2019)

A Low Complexity Algorithm with O(√T) Regret and O(1) Constraint Violations for Online Convex Optimization with Long Term Constraints. - Hao Yu 002; Michael J. Neely (J. Mach. Learn. Res., 2020)

Online Primal-Dual Mirror Descent under Stochastic Constraints. - Xiaohan Wei; Hao Yu 002; Michael J. Neely (Proc. ACM Meas. Anal. Comput. Syst., 2020)

Byzantine-resilient distributed learning under constraints. - Dongsheng Ding; Xiaohan Wei; Hao Yu 002; Mihailo R. Jovanovic (ACC, 2021)