SEP 10, 2026 · PREPRINT
Convex Optimization with Nested Evolving Feasible Sets (CONES) under Time-Varying Loss Functions
arXiv
This is a theoretical computer science paper presenting algorithmic results and complexity bounds for an optimization problem, not clinical evidence or empirical validation in any applied domain.
Insufficient InformationRahul Vaze
Reported
Regret (convex case)O(T^(1−β))
Movement cost (convex case)O(T^β)
Parameter rangeβ ∈ [0,1)