Related papers: Numerical study of optimal partitioning problems i…
The edge isoperimetric problem for a graph $G$ is to determine, for each $n$, the minimum number of edges leaving any set of $n$ vertices. In general this problem is NP-hard, but exact solutions are known in some special cases, for example…
We investigate the localization of two incoherent point sources with arbitrary angular and axial separations in the paraxial approximation. By using quantum metrology techniques, we show that a simultaneous estimation of the two separations…
A four dimensional systematic mathematical approach for investigating propagation and coupling of wave modes in a slowly varying (in all space directions and time) anisotropic, absorbing plasma is represented. The formalism is especially…
We propose a volumetric formulation for computing the Optimal Transport problem defined on surfaces in $\mathbb{R}^3$, found in disciplines like optics, computer graphics, and computational methodologies. Instead of directly tackling the…
A numerical approach to the problem of wave scattering by many small particles is developed under the assumptions k<<1, d>>a, where a is the size of the particles and d is the distance between the neighboring particles. On the wavelength…
The Bayesian solution to a statistical inverse problem can be summarised by a mode of the posterior distribution, i.e. a MAP estimator. The MAP estimator essentially coincides with the (regularised) variational solution to the inverse…
This thesis studies the graph alignment problem, the noisy version of the graph isomorphism problem, which aims to find a matching between the nodes of two graphs which preserves most of the edges. Focusing on the planted version where the…
We developed an optimal in the natural sense algorithm of partition in cluster analysis based on the densities of observations in the different hypotheses. These densities may be characterized, for instance, as the multivariate so-called…
We consider the minimization of integral functionals in one dimension and their approximation by $r$-adaptive finite elements. Including the grid of the FEM approximation as a variable in the minimization, we are able to show that the…
Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain improved approximation…
Given a convex set $\Omega$ of $\mathbb{R}^n$, we consider the shape optimization problem of finding a convex subset $\omega\subset \Omega$, of a given measure, minimizing the $p$-distance functional $$\mathcal{J}_p(\omega) :=…
Obtaining general relations between macroscopic properties of random assemblies, such as density, and the microscopic properties of their constituent particles, such as shape, is a foundational challenge in the study of amorphous materials.…
In this paper we study the loss of precision of numerical methods discretizing anisotropic problems and propose alternative approaches free from this drawback. The deterioration of the accuracy is observed when the coordinates and the mesh…
The H(div)-conforming approach for the Brinkman equation is studied numerically, verifying the theoretical a priori and a posteriori analysis in previous work of the authors. Furthermore, the results are extended to cover a non-constant…
In this paper are discussed possible many body generalizations of the expanding locally anisotropic metric ansatz with respect to approximately Newtonian gravitational systems. This ansatz consistently describes local point-like matter…
Many popular learning algorithms (E.g. Regression, Fourier-Transform based algorithms, Kernel SVM and Kernel ridge regression) operate by reducing the problem to a convex optimization problem over a vector space of functions. These methods…
Many recent problems in signal processing and machine learning such as compressed sensing, image restoration, matrix/tensor recovery, and non-negative matrix factorization can be cast as constrained optimization. Projected gradient descent…
In this work, a graph partitioning problem in a fixed number of connected components is considered. Given an undirected graph with costs on the edges, the problem consists of partitioning the set of nodes into a fixed number of subsets with…
We prove that certain nonlocal functionals defined on partitions made of measurable sets Gamma-converge to a local functional modeled on the perimeter in the sense of De Giorgi. Those nonlocal functionals involve generalized surface tension…
We present a general technique, based on parametric search with some twist, for solving a variety of optimization problems on a set of semi-algebraic geometric objects of constant complexity. The common feature of these problems is that…