31 citations · 32 across the 8 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2024
Optimal Decentralized Smoothed Online Convex Optimization
Neelkamal Bhuyan, Debankur Mukherjee, Adam Wierman
We study the multi-agent Smoothed Online Convex Optimization (SOCO) problem, where agents interact through a communication graph. In each round, each agent receives a stron…
math.OC2023
Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization
Neelkamal Bhuyan, Debankur Mukherjee, Adam Wierman
We study the smoothed online quadratic optimization (SOQO) problem where, at each round , a player plays an action in response to a quadratic hitting cost and an additiona…