Related papers: High order numerical schemes for transport equatio…
This paper introduces a novel approach to compute the numerical fluxes at the cell boundaries in the finite volume approach. Explicit gradients used in deriving the reconstruction polynomials are replaced by high-order gradients computed by…
In this paper, we study higher-order-accurate-in-time minimizing movements schemes for Wasserstein gradient flows. We introduce a novel accelerated second-order scheme, leveraging the differential structure of the Wasserstein space in both…
By employing non-equispaced grid points near boundaries, boundary-optimized upwind finite-difference operators of orders up to nine are developed. The boundary closures are constructed within a diagonal-norm summation-by-parts (SBP)…
In many mobile robotics scenarios, such as drone racing, the goal is to generate a trajectory that passes through multiple waypoints in minimal time. This problem is referred to as time-optimal planning. State-of-the-art approaches either…
In this paper, we discuss our approach and algorithmic framework for solving large-scale security constrained optimal power flow (SCOPF) problems. SCOPF is a mixed integer non-convex optimization problem that aims to obtain the minimum…
Federated learning heavily relies on distributed gradient descent techniques. In the situation where gradient information is not available, the gradients need to be estimated from zeroth-order information, which typically involves computing…
We propose and analyze a randomized zeroth-order approach based on approximating the exact gradient byfinite differences computed in a set of orthogonal random directions that changes with each iteration. A number ofpreviously proposed…
Many problems in machine learning involve calculating correspondences between sets of objects, such as point clouds or images. Discrete optimal transport provides a natural and successful approach to such tasks whenever the two sets of…
Transport-based density estimation methods are receiving growing interest because of their ability to efficiently generate samples from the approximated density. We further invertigate the sequential transport maps framework proposed from…
We formulate and solve a Bayesian inverse Navier-Stokes (N-S) problem that assimilates velocimetry data in order to jointly reconstruct a 3D flow field and learn the unknown N-S parameters, including the boundary position. By hardwiring a…
Variational approaches have been used successfully as a strategy to take advantage from real data measurements. In several applications, this approach gives a means to increase the accuracy of numerical simulations. In the particular case…
The purpose of this note is to show how simple Optimal Transport arguments, on the real line, can be used in Superconcentration theory. This methodology is efficient to produce sharp non-asymptotic variance bounds for various functionals…
This paper focuses on designing edge-weighted networks, whose robustness is characterized by maximizing algebraic connectivity, or the second smallest eigenvalue of the Laplacian matrix. This problem is motivated by cooperative vehicle…
In this Doctoral Dissertation we propose new variational principles for traffic assignment problems. So to find equillibrium we have to solve large-scale convex optimization problem of special (multilevel) type. We propose different…
Gradient-related first-order methods have become the workhorse of large-scale numerical optimization problems. Many of these problems involve nonconvex objective functions with multiple saddle points, which necessitates an understanding of…
We study a convex resource allocation problem in which lower and upper bounds are imposed on partial sums of allocations. This model is linked to a large range of applications, including production planning, speed optimization, stratified…
Several numerical schemes are proposed for the solution of Nonequilibrium Langevin Dynamics (NELD), and the rate of convergence is analyzed. Due to the special deforming boundary conditions used, care must be taken when using standard…
We introduce a new class of objectives for optimal transport computations of datasets in high-dimensional Euclidean spaces. The new objectives are parametrized by $\rho \geq 1$, and provide a metric space $\mathcal{R}_{\rho}(\cdot, \cdot)$…
In this letter we propose an optimization-based boundary controller for traffic flow dynamics capable of achieving both stability and invariance conditions. The approach is based on the definition of Boundary Control Barrier Functionals,…
This paper deals with the existence of optimal transport maps for some optimal transport problems with a convex but non strictly convex cost. We give a decomposition strategy to address this issue. As part of our strategy, we have to treat…