Related papers: Solving the Convex Flow Problem
The DC Power Flow approximation has been widely used for decades in both industry and academia due to its computational speed and simplicity, but suffers from inaccuracy, in part due to the assumption of a lossless network. Here we present…
Recent advances in inverse problem solving have increasingly adopted flow priors over diffusion models due to their ability to construct straight probability paths from noise to data, thereby enhancing efficiency in both training and…
This two-part paper details a theory of solvability for the power flow equations in lossless power networks. In Part I, we derive a new formulation of the lossless power flow equations, which we term the fixed-point power flow. The model is…
We consider multi--hop wireless networks carrying unicast flows for multiple users. Each flow has a specified delay deadline, and the lossy wireless links are modelled as binary symmetric channels (BSCs). Since transmission time, also…
An effective means for analyzing the impact of novel operating schemes on power systems is time domain simulation, for example for investigating optimization-based curtailment of renewables to alleviate voltage violations. Traditionally,…
This paper develops a branch-flow based optimal power flow (OPF) problem for multi-phase distribution networks that allows for tap selection of wye, closed-delta, and open-delta step-voltage regulators (SVRs). SVRs are assumed ideal and…
This paper proposes an algorithmic framework for solving parametric optimization problems which we call adjoint-based predictor-corrector sequential convex programming. After presenting the algorithm, we prove a contraction estimate that…
The unreal high flows may appear on the actually congested links in the result when a monotonically increasing link travel time function of flow volume is adopted in traffic assignment. The fixed link flow results of a static traffic…
We investigate robust optimization problems defined for maximizing convex functions. For finite uncertainty set, we develop a geometric branch-and-bound algorithmic approach to solve this problem. The geometric branch-and-bound algorithm…
Convexity, though extremely important in mathematical programming, has not drawn enough attention in the field of dynamic programming. This paper gives conditions for verifying convexity of the cost-to-go functions, and introduces an…
AC optimal power flow (AC OPF) is a fundamental problem in power system operations. Accurately modeling the network physics via the AC power flow equations makes AC OPF a challenging nonconvex problem. To search for global optima, recent…
We study the problem of finding flows in undirected graphs so as to minimize the weighted $p$-norm of the flow for any $p > 1$. When $p=2$, the problem is that of finding an electrical flow, and its dual is equivalent to solving a Laplacian…
The optimal power flow (OPF) problem minimizes the operating cost of an electric power system. Applications of convex relaxation techniques to the non-convex OPF problem have been of recent interest, including work using the Lasserre…
In this paper, we focus on solving a distributed convex optimization problem in a network, where each agent has its own convex cost function and the goal is to minimize the sum of the agents' cost functions while obeying the network…
This paper presents a first-order {distributed continuous-time algorithm} for computing the least-squares solution to a linear equation over networks. Given the uniqueness of the solution, with nonintegrable and diminishing step size,…
In this work, we conduct a comparative study on two deep unfolding mechanisms to efficiently perform power control in the next generation wireless networks. The power control problem is formulated as energy efficiency over multiple…
In the present paper, we apply the network simplex algorithm for solving the minimum cost flow problem, to the maximum flow problem. Then we prove that the cycling phenomenon which causes the infinite loop in the algorithm, does not occur…
Seeking the convex hull of an object is a very fundamental problem arising from various tasks. In this work, we propose two variational convex hull models using level set representation for 2-dimensional data. The first one is an exact…
Internet traffic continues to grow relentlessly, driven largely by increasingly high resolution video content. Although studies have shown that the majority of packets processed by Internet routers are pass-through traffic, they nonetheless…
Given its wide spectrum of applications, the classical problem of all-terminal network reliability evaluation remains a highly relevant problem in network design. The associated optimization problem -- to find a network with the best…