Optimization for One, Feasibility for Most: Decoupling Optimization from Feasibility in Chance-Constrained Programs

arXiv:2610.19027 · math.OC, cs.LG · Submitted 2026-10-13 · Read on arXiv

math.OC, cs.LG

Submitted: 2026-10-13

Updated: 2026-10-13

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Decoupling — 1× in this paper · explained in 2 episodes

Related papers

• Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
• Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
• Incremental Learning in Mirror Flows
• Second-Order Optimization with Asynchronous Curvature
• Online Control via Counterfactual Tracking
• Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability