Related papers: The Convex Geometry of Network Flows
We provide some counterexamples concerning the uniqueness and regularity of weak solutions to the initial-boundary value problem for gradient flows of certain strongly polyconvex functionals by showing that such a problem can possess a…
Shape optimization with constraints given by partial differential equations (PDE) is a highly developed field of optimization theory. The elegant adjoint formalism allows to compute shape gradients at the computational cost of a further PDE…
This paper presents a heuristic algorithm to solve Minimum Convex-Cost Network Flow Problems (MC-CNFP). This solution algorithm is constructed on the concepts of Network Simplex Method (NSM) for minimum cost network flow problem, Convex…
Quadratic flows have the unique property of uniform strain and are commonly used in turbulence modeling and hydrodynamic analysis. While previous application focused on two-dimensional homogeneous fluid, this study examines the geometric…
We study a 2D potential flow of an ideal fluid with a free surface with decaying conditions at infinity. By using the conformal variables approach, we study a particular solution of Euler equations having a pair of square-root branch points…
The construction of a cost minimal network for flows obeying physical laws is an important problem for the design of electricity, water, hydrogen, and natural gas infrastructures. We formulate this problem as a mixed-integer non-linear…
In this paper, we study the problem of shock reflection by a wedge, with the potential flow equation, which is a simplification of the Euler System. In the work of M. Feldman and G. Chen, the existence theory of shock reflection problems…
Flow-based models are powerful tools for designing probabilistic models with tractable density. This paper introduces Convex Potential Flows (CP-Flow), a natural and efficient parameterization of invertible models inspired by the optimal…
The classical Okamura-Seymour theorem states that for an edge-capacitated, multi-commodity flow instance in which all terminals lie on a single face of a planar graph, there exists a feasible concurrent flow if and only if the cut…
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow between them along the shortest path. Each edge gets some…
We propose to study maximum flow problems for connectome graphs. We suggest a few computational problems: finding vertex pairs with maximal flow, finding new edges which would increase the maximal flow. Initial computation results for some…
We present variational approximations of boundary value problems for curvature flow (curve shortening flow) and elastic flow (curve straightening flow) in two-dimensional Riemannian manifolds that are conformally flat. For the evolving open…
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…
Convexification techniques have gained increasing interest over the past decades. In this work, we apply a recently developed convexification technique for fractional programs by He, Liu and Tawarmalani (2024) to the problem of determining…
Incompressible fluids on curved surfaces are considered with respect to the interplay between topology, geometry and fluid properties using a surface vorticity-stream function formulation, which is solved using parametric finite elements.…
We develop a new boundary condition for the weak inverse mean curvature flow, which gives canonical and non-trivial solutions in bounded domains. Roughly speaking, the boundary of the domain serves as an outer obstacle, and the evolving…
Given a graph with non-negative edge weights, there are various ways to interpret the edge weights and induce a metric on the vertices of the graph. A few examples are shortest-path, when interpreting the weights as lengths; resistance…
In a network where the cost of flow across an edge is nonlinear in the volume of flow, and where sources and destinations are uniform, one can consider the relationship between total volume $v$ of flow through the network and the minimum…
Some approach to the solution of boundary value problems for finding functions, which are analytical in a wedge, is proposed. If the ratio of the angle at the wedge vertex to a number \pi is rational, then the boundary value problem is…
In this paper, a class of fully nonlinear flows with nonlinear Neumann type boundary condition is considered. This problem was solved partly by the first author under the assumption that the flow is the parabolic type special Lagrangian…