Related papers: ILP formulations for the two-stage stochastic Stei…
The main goal of these notes is to give a review of the equations for two phase flow problems with an interface between the two phases in a self-contained way, and, in particular, to properly include surface tension into the interface…
The Steiner tree problem can be stated in terms of finding a connected set of minimal length containing a given set of finitely many points. We show how to formulate it as a mass-minimization problem for $1$-dimensional currents with…
This paper concerns models and convergence principles for dealing with stochasticity in a wide range of algorithms arising in nonlinear analysis and optimization in Hilbert spaces. It proposes a flexible geometric framework within which…
For solving the continuous Sylvester equation, a class of the multiplicative splitting iteration method is presented. We consider two symmetric positive definite splittings for each coefficient matrix of the continuous Sylvester equations…
A numerical framework for rigorous linear stability analysis of two-phase stratified flows of two immiscible fluids in horizontal circular pipes is presented. For the first time, three-dimensional disturbances, including those at the…
This paper explores the use of Column Generation (CG) techniques in constructing univariate binary decision trees for classification tasks. We propose a novel Integer Linear Programming (ILP) formulation, based on root-to-leaf paths in…
This paper extends the optimal covariance steering problem for linear stochastic systems subject to chance constraints to account for optimal risk allocation. Previous works have assumed a uniform risk allocation to cast the optimal control…
We consider a class of optimal power flow (OPF) applications where some loads offer a modulation service in exchange for an activation fee. These applications can be modeled as multi-period formulations of the OPF with discrete variables…
Recent road trials have shown that guaranteeing the safety of driving decisions is essential for the wider adoption of autonomous vehicle technology. One promising direction is to pose safety requirements as planning constraints in…
This article presents a class of new relaxation modulus-based iterative methods to process the large and sparse implicit complementarity problem (ICP). Using two positive diagonal matrices, we formulate a fixed-point equation and prove that…
Integer Linear Programming (ILP) has a broad range of applications in various areas of artificial intelligence. Yet in spite of recent advances, we still lack a thorough understanding of which structural restrictions make ILP tractable.…
We introduce an iterative scheme for discrete convex minimization problems of $p$-Laplace type such as variational graph $p$-Laplace problems and $\ell^p$ regression. In each iteration, the scheme solves only a weighted least-squares…
A coarse grained description of a two phase fluid is used to study the steady state configuration of the interface separating the coexisting phases, and the motion of the contact line at which the interface intersects a solid boundary. The…
In this talk, we review recent developments towards the calculation of multi-loop scattering amplitudes. In particular, we discuss how the colour-kinematics duality can provide new integral relations at one-loop level via the Loop-Tree…
In this paper, we propose novel mixed-integer linear programming (MIP) formulations to model decision problems posed as influence diagrams. We also present a novel heuristic that can be employed to warm start the MIP solver, as well as…
In this work, we develop analysis and algorithms for a class of (stochastic) bilevel optimization problems whose lower-level (LL) problem is strongly convex and linearly constrained. Most existing approaches for solving such problems rely…
We establish local linear convergence bounds for the ISTA and FISTA iterations on the model LASSO problem. We show that FISTA can be viewed as an accelerated ISTA process. Using a spectral analysis, we show that, when close enough to the…
In the Euclidean Steiner Tree problem, we are given as input a set of points (called terminals) in the $\ell_2$-metric space and the goal is to find the minimum-cost tree connecting them. Additional points (called Steiner points) from the…
This report presents a low computational and cognitive complexity, stable, time accurate and adaptive method for the Navier-Stokes equations. The improved method requires a minimally intrusive modification to an existing program based on…
In this paper we present two optimized eight-step symmetric implicit methods with phase-lag order ten and infinite (phase-fitted). The methods are constructed to solve numerically the radial time-independent Schr\"odinger equation with the…