Related papers: The P\'olya-Tchebotarev problem with semiclassical…
This paper mainly investigates the approximation of a global maximizer of the 1-D Monge-Kantorovich mass transfer problem through the approach of nonlinear differential equations with Dirichlet boundary. Using an approximation mechanism,…
In the realm of contemporary physics, the bootstrap method is typically associated with an optimization-based approach to problem-solving. This method leverages our understanding of a specific physical problem, which is used as the…
Minimizing the so-called "Dirichlet energy" with respect to the domain under a volume constraint is a standard problem in shape optimization which is now well understood. This article is devoted to a prototypal non-linear version of the…
In this thesis, we settle the computational complexity of some fundamental questions in polynomial optimization. These include the questions of (i) finding a local minimum, (ii) testing local minimality of a point, and (iii) deciding…
We study the solution set to multivariate Chebyshev approximation problem, focussing on the ill-posed case when the uniqueness of solutions can not be established via strict polynomial separation. We obtain an upper bound on the dimension…
In this paper, we consider two types of problems that have some similarity in their structure, namely, min-min problems and min-max saddle-point problems. Our approach is based on considering the outer minimization problem as a minimization…
We study the potential theory of a large class of infinite dimensional L\'evy processes, including Brownian motion on abstract Wiener spaces. The key result is the construction of compact Lyapunov functions, i.e. excessive functions with…
Global polynomial optimization methods typically rely on compactness of the feasible region in order to find solutions. These methods can incur considerable computational expense and most commercially available solvers do not verify the…
We consider the energy critical nonlinear Schrodinger equation on generic irrational tori. Using the long-time Strichartz estimates proved in [8], we establish polynomial upper bounds for higher Sobolev norms for solutions with small…
This paper is devoted to spherical measures and point configurations optimizing three-point energies. Our main goal is to extend the classic optimization problems based on pairs of distances between points to the context of three-point…
We consider a nonlinear Schr\"odinger equation with double power nonlinearity, where one power is focusing and mass critical and the other mass sub-critical. Classical variational arguments ensure that initial data with mass less than the…
This paper presents a simple approach to low-thrust optimal-fuel and optimal-time transfer problems between two elliptic orbits using the Cartesian coordinates system. In this case, an orbit is described by its specific angular momentum and…
We introduce a new non-linear optimal transport formulation for a pair of probability measures on $\mathbb{R}^d$ sharing a common barycentre, in which admissible transference plans satisfy two martingale-type constraints. This bi-martingale…
The nonsymmetric T-Riccati equation is a quadratic matrix equation where the linear part corresponds to the so-called T-Sylvester or T-Lyapunov operator that has previously been studied in the literature. It has applications in…
We provide an explicit algorithm to solve the idempotent analogue of the discrete Monge-Kantorovich optimal mass transportation problem with the usual real number field replaced by the tropical (max-plus) semiring, in which addition is…
We study the electrical distribution network reconfiguration problem, defined as follows. We are given an undirected graph with a root vertex, demand at each non-root vertex, and resistance on each edge. Then, we want to find a spanning…
We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values…
The Minimum Linear Arrangement problem (MLA) consists of finding a mapping $\pi$ from vertices of a graph to distinct integers that minimizes $\sum_{\{u,v\}\in E}|\pi(u) - \pi(v)|$. In that setting, vertices are often assumed to lie on a…
In this work, we establish the first separation between computation with bounded and unbounded space, for problems with short outputs (i.e., working memory can be exponentially larger than output size), both in the classical and the quantum…
This survey synthesizes the current state of the art on the regularity theory for solutions to the optimal partition problem. Namely, we consider non-negative, vector-valued Sobolev functions whose components have mutually disjoint support,…