1 citations · 1 across the 5 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
math.OC2026
Gradient-Only Online Convex Optimization with a Single Quadratic Leader
Kamiar Asgari
We study online convex optimization on a bounded Euclidean domain when the learner receives only one subgradient at its prediction and knows neither the horizon, a gradient bound,…
eess.SY2026
Optimal Regret for Online Storage Control via Cumulative Policies
Kamiar Asgari, Michael J. Neely
We study online control of a scalar storage system with adversarial nonnegative arrivals, known retention coefficient, and convex costs depending on both state and action. Each act…
eess.SY2026
Online Constrained Control of Storage Systems via Simplex Disturbance-Action Policies
Kamiar Asgari, Michael J. Neely
We study online control of a scalar storage system with nonnegative adversarial resource arrivals and state-dependent action constraints. The adversarial, time-varying cost depends…