SearcharxivSearch

arXiv subjects

Alexander While

Publications and source records attributed to Alexander While.

2 recordsLinked to original sources

Physics-Informed Tensor Completion with Application to Distribution System State Estimation

State estimation in power distribution networks often involves sparse, noisy, and heterogeneous measurements, making classical weighted least-squares methods unreliable in low-observability regimes. To meet this challenge we develop a physics-informed low-rank tensor completion method. The method encodes voltage phasor components, voltage magnitudes, and power injections over time in a low-rank tensor, while incorporating physics through convex residual penalties. For distribution network state estimation, these residuals are instantiated using linearized power-flow equations, yielding a convex optimization problem over a tensor gauge ball, equivalently represented as a polytope implicitly described via integer programming. We solve this problem using globally convergent blended conditional gradients, resulting in a general-purpose algorithmic framework that can be adapted across different domains and applications where low-rank structure and convex physics residuals are available. We also derive a deterministic error bound showing that, under a restricted stability condition, the estimation error is controlled by measurement noise and physics-model mismatch. Numerical experiments show that the proposed method substantially improves state recovery compared with purely data-driven tensor completion and weighted least-squares, especially in low-observability regimes with missing data.

math.OC

QUBO Formulations for MIP Symmetry Detection

Formulation symmetry in mixed-integer programming (MIP) can hinder solver performance by inducing redundant search, but detecting such symmetries is also a significant computational challenge. This paper explores the potential for quantum computing to handle symmetry detection. Quantum is a promising alternative to classical compute, but this emerging technology has limited hardware capacity in terms of input problem size. This paper explores the use of Quadratic Unconstrained Binary Optimization (QUBO) models for symmetry detection, as QUBO is the canonical format for quantum optimization platforms. To help address the input size bottleneck, we develop full, reduced, and decomposed QUBO as well as QUBO-Plus formulations for MIP symmetry detection. Computational experiments on the MIPLIB 2017 benchmark are used to estimate the quantum computing resources needed for practical problems.

math.OC