Self-Certifying Primal-Dual Optimization Proxies for Large-Scale Batch Economic Dispatch
Not on the map. Why?
Abstract (arXiv)
Recent research has shown that optimization proxies can be trained to high fidelity, achieving average optimality gaps under 1% for large-scale problems. However, worst-case analyses show that there exist in-distribution queries that result in orders of magnitude higher optimality gap, making it difficult to trust the predictions in practice. This paper aims at striking a balance between classical solvers and optimization proxies in order to enable trustworthy deployments with interpretable speed-optimality tradeoffs based on a user-defined optimality threshold. To this end, the paper proposes a hybrid solver that leverages duality theory to efficiently bound the optimality gap of predictions, falling back to a classical solver for queries where optimality cannot be certified. To improve the achieved speedup of the hybrid solver, the paper proposes an alternative training procedure that combines the primal and dual proxy training. Experiments on large-scale transmission systems show that the hybrid solver is highly scalable. The proposed hybrid solver achieves speedups of over 1000x compared to a parallelized simplex-based solver while guaranteeing a maximum optimality gap of 2%.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 27 of its 36 references that are in the map. First posted on arXiv 17 Oct 2025.
Builds on
27 of 36 references.
References · 27
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
- 2021Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Robustness Verificationcited by 224
- 2019Algorithms for Verifying Deep Neural Networkscited by 221
- 2015Parallelizing the dual revised simplex methodcited by 83
- 2019The Power Grid Library for Benchmarking AC Optimal Power Flow Algorithmscited by 63
- 2022Self-Supervised Primal-Dual Learning for Constrained Optimizationcited by 60
- 2023End-to-End Feasible Optimization Proxies for Large-Scale Economic Dispatchcited by 35
- 2022JuMP 1.0: Recent improvements to a modeling language for mathematical optimizationcited by 34
- 2023RAYEN: Imposition of Hard Convex Constraints on Neural Networkscited by 30
- 2024HardNet: Hard-Constrained Neural Networks with Universal Approximation Guaranteescited by 29
- 2021Physics-Informed Neural Networks for Minimising Worst-Case Violations in DC Optimal Power Flowcited by 23
15 more
- 2020Smart-PGSim: Using Neural Network to Accelerate AC-OPF Power Grid Simulationcited by 19
- 2025Pinet: Optimizing hard-constrained neural networks with orthogonal projection layerscited by 17
- 2024PDHG-Unrolled Learning-to-Optimize Method for Large-Scale Linear Programmingcited by 14
- 2025Physics-Informed Neural Networks with Hard Nonlinear Equality and Inequality Constraintscited by 14
- 2023Compact Optimization Learning for AC Optimal Power Flowcited by 11
- 2024Dual Lagrangian Learning for Conic Optimizationcited by 11
- 2025PGLearn -- An Open-Source Learning Toolkit for Optimal Power Flowcited by 11
- 2025Enforcing Hard Linear Constraints in Deep Learning Models with Decision Rulescited by 10
- 2023Real-Time Risk Analysis with Optimization Proxiescited by 5
- 2024Dual Interior Point Optimization Learningcited by 4
- 2022Just-In-Time Learning for Operational Risk Assessment in Power Gridscited by 2
- 2024Scalable Exact Verification of Optimization Proxies for Large-Scale Optimal Power Flowcited by 2
- 2024Compact Optimality Verification for Optimization Proxiescited by 2
- 2024Karush-Kuhn-Tucker Condition-Trained Neural Networks (KKT Nets)cited by 1
- 2025Benders Decomposition using Graph Modeling and Multi-Parametric Programmingcited by 1
Built on by
Not cited yet.