mlsanityData to 14 Oct 2026

WARP: A Benchmark for Primal-Dual Warm-Starting of Interior-Point Solvers

arXiv 2605.05728 ↗First posted 7 May 2026cs.LG cs.AI cs.SYcited by 0

Not on the map. Why?

Abstract (arXiv)

Solving AC Optimal Power Flow (AC-OPF) is of central importance in electricity market operations, where interior-point methods (IPMs) such as IPOPT are the standard solvers. A growing body of work uses machine learning to predict primal warm-start iterates, reporting iteration reductions of 30-46%. We show that these reported gains rest on an inappropriate evaluation baseline: prior methods benchmark against the flat start Vm = 1, Va = 0, whereas the solver's actual default - the variable-bound midpoint (l+u)/2 - is near-optimal for log-barrier centrality. Against this corrected baseline, no primal-only warm-start method reduces solver iterations. We trace the failure to a geometric property of interior-point methods: primal prediction accuracy is anticorrelated with convergence speed, and providing the ground-truth optimal solution x^* without dual variables causes the solver to diverge. Oracle experiments establish that the complete primal-dual-barrier state (x^*, λ^*, z^*, μ^*) reduces IPOPT iterations from 23 to 3 - an 85% reduction that is structurally inaccessible to primal-only methods. To enable rigorous evaluation of warm-start methods on this task, we release a benchmark suite comprising dual-labeled AC-OPF datasets with IPOPT-extracted solutions, a corrected evaluation protocol, and WARP - a topology-conditioned encode-process-decode interaction network that predicts the full interior-point state (hatx, hatλ, hatz, hatμ) on the heterogeneous constraint graph. WARP achieves a 76% reduction in IPOPT iterations while natively accommodating N-1 contingency topology variations without retraining.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 39 references that are in the map. First posted on arXiv 7 May 2026.

Builds on

23 of 39 references.

References · 23

  1. 2018Relational inductive biases, deep learning, and graph networkscited by 1,360
  2. 2020Learning Mesh-Based Simulation with Graph Networkscited by 868
  3. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 623
  4. 2016Learning to learn by gradient descent by gradient descentcited by 620
  5. 2016Interaction Networks for Learning about Objects, Relations and Physicscited by 509
  6. 2021DC3: A learning method for optimization with hard constraintscited by 184
  7. 2021End-to-End Constrained Optimization Learning: A Surveycited by 157
  8. 2019Predicting AC Optimal Power Flows: Combining Deep Learning and Lagrangian Dual Methodscited by 94
  9. 2022Self-Supervised Primal-Dual Learning for Constrained Optimizationcited by 61
  10. 2018Learning for Constrained Optimization: Identifying Optimal Active Constraint Setscited by 36
  11. 2019Learning Warm-Start Points for AC Optimal Power Flowcited by 32
  12. 2023Learning to Warm-Start Fixed-Point Optimization Algorithmscited by 32
11 more
  1. 2019Learning for DC-OPF: Classifying active sets using neural netscited by 31
  2. 2022Topology-aware Graph Neural Networks for Learning Feasible and Adaptive ac-OPF Solutionscited by 28
  3. 2024CANOS: A Fast and Scalable Neural AC-OPF Solver Robust To N-1 Perturbationscited by 27
  4. 2022Learning to Solve Optimization Problems with Hard Linear Constraintscited by 23
  5. 2024Learning Constrained Optimization with Deep Augmented Lagrangian Methodscited by 16
  6. 2019Data-Driven Screening of Network Constraints for Unit Commitmentcited by 11
  7. 2020Hybrid Learning Aided Inactive Constraints Filtering Algorithm to Enhance AC OPF Solution Timecited by 7
  8. 2023Constraint-Informed Learning for Warm Starting Trajectory Optimizationcited by 7
  9. 2020Deep learning architectures for inference of AC-OPF solutionscited by 4
  10. 2024Dual Interior Point Optimization Learningcited by 4
  11. 2024IPM-LSTM: A Learning-Based Interior Point Method for Solving Nonlinear Programscited by 4

Built on by

Not cited yet.