Support Discovery With Iteratively Reweighted Least Squares for Fixed-Charge Network Flow

arXiv:2609.09295 · math.OC, cs.AI, cs.LG, cs.NA, math.NA · Submitted 2026-09-08 · Read on arXiv

math.OC, cs.AI, cs.LG, cs.NA, math.NA

Submitted: 2026-09-08

Updated: 2026-09-08

Comments: 20 pages

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

Terminology

• Benchmark — 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
• Online Control via Counterfactual Tracking
• Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability
• Petrov-Galerkin operator inference with application to stability-encouraging identification