SOURCE-LINKED INTELLIGENCE

Convex Optimization with Nested Evolving Feasible Sets (CONES) under Time-Varying Loss Functions

arXiv · AI, language, vision and robotics · article · Sep 10, 2026 · UTC

Convex Optimization with Nested Evolving Feasible Sets (CONES)} was introduced in \cite{CONESVaze} where the objective function \(f\) remains fixed but the feasible region evolves over time as a nested sequence \(S_1 \supseteq S_2 \supseteq \cdots \supseteq S_T\). The goal of an online algorithm is to simultaneously minimize the regret with respect to hindsight static optimal benchmark and the total movement cost $M_\cA(T)$ while ensuring feasibility at all times. CONES is an optimization-oriented generalization of the well-known \emph{nested convex body chasing} (NCBC). In this paper, we exte

Read original source ↗ Open in workspace

recordType

paper

region

Global