arXiv AI

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

arXiv:2609. 09295v1 Announce Type: cross Abstract: The fixed-charge network flow problem (FCNFP) couples continuous flow allocation with discrete arc-activation decisions, making it a canonical but computationally challenging model for a variety of network design and resource allocation problems.

arXiv Machine Learning
Sep 25

GridSFM: A Foundation Model for Solving AC Optimal Power Flow

GridSFM is a 15‑million‑parameter physics‑inspired graph neural network that serves as a foundation model for solving AC Optimal Power Flow (AC‑OPF) across diverse grid topologies. Pretrained on 54 topologies ranging from 500 to 4,000 buses, it achieves a 2.45 % zero‑shot generation‑cost error on a held‑out 10,000‑bus case and adapts to unseen grids with only 100 solved instances using a physics‑informed fine‑tuning scheme based on Newton’s method. The authors address the disconnected feasible set of AC‑OPF by lifting and relaxing constraints with logarithmically penalized slacks, proving the resulting elastic feasible set is contractible and that solutions can be projected back onto the original feasible set.

By Luke Bhan, Weiwei Yang, Margaret Capetz, Baosen Zhang
arXiv Machine Learning
Aug 27

Scalable Self-Supervised Learning for Multiphase AC-OPF in Distribution Systems with Topology Reconfiguration

The paper introduces Penalty + Sequential Linearized Feasibility Seeking (SLFS), a self‑supervised learning framework for solving multiphase AC optimal power flow (AC‑OPF) in distribution systems with topology reconfiguration. SLFS trains directly from the AC‑OPF objective and constraints using a differentiable fixed‑point power flow solver, avoiding the need for labeled optimal solutions. It achieves negligible optimality gaps and near‑zero constraint violations on IEEE feeders up to 8,500 nodes, delivering up to three orders of magnitude speedups over IPOPT while maintaining robustness to large distributional shifts.

By Hoang T. Nguyen, Shaohui Liu, Reetam Sen Biswas, Varsha Pendyala, Nurali Virani, Deepjyoti Deka, Priya L. Donti
arXiv Machine Learning
Jul 16

Power Homotopy for Zeroth-Order Non-Convex Optimizations

arXiv:2511. 13592v2 Announce Type: replace-cross Abstract: The existing method of GS-PowerOpt solves the non-convex optimization problem of the form $\max_{\boldsymbol{x} \in \mathbb{R}^d} f(\boldsymbol{x})$ through maximizing a Gaussian-smoothed surrogate $F_{N,\sigma}(\boldsymbol{\mu}) = \mathbb{E}_{\boldsymbol{x}\sim\mathcal{N}(\boldsymbol{\mu},\sigma^2 I_d)}[e^{N f(\boldsymbol{x})}]$.

By Chen Xu
Hugging Face Trending Papers
Aug 20

Learning Early-to-Final Solution Consistency for MILP Acceleration

Mixed-Integer Linear Programming (MILP) is a fundamental problem class in operations research and combinatorial optimization, with broad applications to industrial decision-making. Owing to their NP-hardness, however, modern solvers may struggle to find high-quality solutions for challenging MILP instances within practical time limits.

arXiv AI
Jul 1

Optimization Algorithms for Joint OFDM Waveform Design and RIS Configuration in 6G Networks: From Convex Relaxation to Foundation Models

arXiv:2606. 31334v1 Announce Type: new Abstract: Joint OFDM-RIS optimization for 6G is a mixed-integer nonlinear programming (MINLP) problem covering sum-rate maximization, energy efficiency, max-min fairness, and peak-to-average power ratio (PAPR)-constrained objectives.

By Ahmet Kaplan