相关论文: Efficient preconditioners for solving dynamical op…
We propose an {\em implementable} numerical scheme for the discretization of linear-quadratic optimal control problems involving SDEs in higher dimensions with {\em control constraint}. For time discretization, we employ the implicit Euler…
In this paper, we describe and analyze the spectral properties of a symmetric positive definite inexact block preconditioner for a class of symmetric, double saddle-point linear systems. We develop a spectral analysis of the preconditioned…
This work presents a novel algorithm for impulsive optimal control of linear time-varying systems with the inclusion of input magnitude constraints. Impulsive optimal control problems, where the optimal input solution is a sum of delta…
We provide a method to solve optimization problem when objective function is a complex stochastic simulator of an urban transportation system. To reach this goal, a Bayesian optimization framework is introduced. We show how the choice of…
We consider an optimal transport problem with backward martingale constraint. The objective function is given by the scalar product of a pseudo-Euclidean space $S$. We show that the supremums over maps and plans coincide, provided that the…
We study a rather general class of optimal "ballistic" transport problems for matrix-valued measures. These problems naturally arise, in the spirit of \emph{Y. Brenier. Comm. Math. Phys. (2018) 364(2) 579-605}, from a certain dual…
In this work, we solve a discrete optimal transport problem in a nonuniform environment. To solve the optimal transport problem, we build the cost matrix and then use classical solvers for discrete optimal transport. The challenge is to…
This survey has been written in occasion of the School and Workshop about Optimal Transport on Quantum Structures at Erd\"os Center in September 2022. We discuss some recent results on noncommutative entropic optimal transport problems and…
We study preconditioned proximal point methods for a class of saddle point problems, where the preconditioner decouples the overall proximal point method into an alternating primal--dual method. This is akin to the Chambolle--Pock method or…
Selecting the fastest algorithm for a specific signal/image processing task is a challenging question. We propose an approach based on the Performance Estimation Problem framework that numerically and automatically computes the worst-case…
We propose a novel approach for navigating in polygonal environments by synthesizing controllers that take as input relative displacement measurements with respect to a set of landmarks. Our algorithm is based on solving a sequence of…
A novel preconditioner of Neumann-Neumann type for the Stokes-Darcy problem is studied, where optimal weights of the local subproblems that define the preconditioner are obtained by minimizing the convergence rate of the method in the…
Inspired by the Boltzmann kinetics, we propose a collision-based dynamics with a Monte Carlo solution algorithm that approximates the solution of the multi-marginal optimal transport problem via randomized pairwise swapping of sample…
Inactive constraints do not contribute to the solution of an optimal control problem, but increase the problem size and burden the numerical computations. We present a novel strategy for handling inactive constraints efficiently by…
Given a standard Brownian motion $B^{\mu}=(B_t^{\mu})_{0\le t\le T}$ with drift $\mu \in IR$ and letting $g$ denote the last zero of $B^{\mu}$ before $T$, we consider the optimal prediction problem V_*=\inf_{0\le \tau \le T}\mathsf…
We propose a variational model with diffeomorphic optimal transportation for joint image reconstruction and motion estimation. The proposed model is a production of assembling the Wasserstein distance with the Benamou--Brenier formula in…
PDE-constrained optimization aims at finding optimal setups for partial differential equations so that relevant quantities are minimized. Including sparsity promoting terms in the formulation of such problems results in more practically…
There are many significant applied contexts that require the solution of discontinuous optimization problems in finite dimensions. Yet these problems are very difficult, both computationally and analytically. With the functions being…
This paper presents a trajectory generation method that optimizes a quadratic cost functional with respect to linear system dynamics and to linear input and state constraints. The method is based on continuous-time flatness-based trajectory…
In this paper, we propose a distributed algorithm for solving large-scale separable convex problems using Lagrangian dual decomposition and the interior-point framework. By adding self-concordant barrier terms to the ordinary Lagrangian, we…