Byzantine-resilient distributed learning under constraints.
Proceedings of the 2021 American Control Conference, 2021
Online Primal-Dual Mirror Descent under Stochastic Constraints.
Proc. ACM Meas. Anal. Comput. Syst., 2020
A Low Complexity Algorithm with O(√T) Regret and O(1) Constraint Violations for Online Convex Optimization with Long Term Constraints.
J. Mach. Learn. Res., 2020
Learning-Aided Optimization for Energy-Harvesting Devices With Outdated State Information.
IEEE/ACM Trans. Netw., 2019
A New Backpressure Algorithm for Joint Rate Control and Routing With Vanishing Utility Optimality Gaps and Finite Queue Lengths.
IEEE/ACM Trans. Netw., 2018
On the Convergence Time of Dual Subgradient Methods for Strongly Convex Programs.
IEEE Trans. Autom. Control., 2018
Online Learning in Weakly Coupled Markov Decision Processes: A Convergence Time Study.
Proc. ACM Meas. Anal. Comput. Syst., 2018
Solving Non-smooth Constrained Programs with Lower Complexity than 𝒪(1/ε): A Primal-Dual Homotopy Smoothing Approach.
CoRR, 2018
Solving Non-smooth Constrained Programs with Lower Complexity than \mathcal{O}(1/\varepsilon): A Primal-Dual Homotopy Smoothing Approach.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Dynamic Transmit Covariance Design in MIMO Fading Systems With Unknown Channel Distributions and Inaccurate Channel State Information.
IEEE Trans. Wirel. Commun., 2017
A Simple Parallel Algorithm with an O(1/t) Convergence Rate for General Convex Programs.
SIAM J. Optim., 2017
Online Convex Optimization with Stochastic Constraints.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017
A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and Finite Constraint Violations for Online Convex Optimization with Long Term Constraints.
CoRR, 2016
Dynamic power allocation in MIMO fading systems without channel distribution information.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016
A primal-dual type algorithm with the O(1/t) convergence rate for large scale constrained convex programs.
Proceedings of the 55th IEEE Conference on Decision and Control, 2016
On the convergence time of the drift-plus-penalty algorithm for strongly convex programs.
Proceedings of the 54th IEEE Conference on Decision and Control, 2015
Duality Codes and the Integrality Gap Bound for Index Coding.
IEEE Trans. Inf. Theory, 2014