Related papers: (Non)uniqueness of minimizers in the least gradien…
That is, given a compact set $B \subset \mathbb{R}^n$ (the boundary) and a subgroup $L$ of the \v{C}ech homology group $\check{H}_{d-1}(B;G)$ of dimension $d$ over some commutative group $G$, we find a compact set $E \supset B$ such that…
This paper is devoted to the study of tilt stability of local minimizers, which plays an important role in both theoretical and numerical aspects of optimization. This notion has been comprehensively investigated in the unconstrained…
The distinct dot products problem, a variant of the Erd\H{o}s distinct distances problem, asks "Given a set $P_n$ of $n$ points in $\mathbb{R}^2$, what is the minimum number $|D(P_n)|$ of distinct dot products they determine?" The best…
We analyse the role of the bang-bang property in affine optimal control problems. We show that many essential stability properties of affine problems are only satisfied when minimizers are bang-bang. Moreover, we prove that almost any…
Inspired by a planar partitioning problem involving multiple improper chambers, this article investigates using classical techniques what can be said of the existence, uniqueness, and regularity of minimizers in a certain free-endpoint…
This doctoral thesis is devoted to the analysis of some minimization problems that involve nonlocal functionals. We are mainly concerned with the $s$-fractional perimeter and its minimizers, the $s$-minimal sets. We investigate the behavior…
We construct a continuous Lagrangian, strictly convex and superlinear in the third variable, such that the associated variational problem has a Lipschitz minimizer which is non-differentiable on a dense set. More precisely, the upper and…
We consider a quasi-variational inequality governed by a moving set. We employ the assumption that the movement of the set has a small Lipschitz constant. Under this requirement, we show that the quasi-variational inequality has a unique…
Derived from the concentration-compactness principle, the concept of generalized minimizer can be used to define generalized solutions of variational problems which may have components ``infinitely'' distant from each other. In this article…
Constructing a discretization of a given set is a major problem in various theoretical and applied disciplines. An offset discretization of a set $X$ is obtained by taking the integer points inside a closed neighborhood of $X$ of a certain…
A framework is introduced for sequentially solving convex stochastic minimization problems, where the objective functions change slowly, in the sense that the distance between successive minimizers is bounded. The minimization problems are…
In the study of deterministic distributed algorithms it is commonly assumed that each node has a unique $O(\log n)$-bit identifier. We prove that for a general class of graph problems, local algorithms (constant-time distributed algorithms)…
In this article, we consider and analyse a small variant of a functional originally introduced in \cite{BLS,LS} to approximate the (geometric) planar Steiner problem. This functional depends on a small parameter $\varepsilon>0$ and…
We study the continuity/discontinuity of the effective boundary condition for periodic homogenization of oscillating Dirichlet data for nonlinear divergence form equations and linear systems. For linear systems we show continuity, for…
Recent years have witnessed a surge of biological interest in the minimum spanning tree (MST) problem for its relevance to automatic model construction using the distances between data points. Despite the increasing use of MST algorithms…
We establish a quantitative lower bound on the reach of flat norm minimizers for boundaries in $\mathbb{R}^2$.
We reprove a result by Ren and Wei concerning the periodicity of minimizers of a one-dimensional liquid drop model in the neutral case. Our proof works for general boundary conditions and also in the non-neutral case.
(NOTE: per referee comments, this article has been split; it is now superseded by "Existence of thread-wire minimizers" and "Near-wire thread-wire minimizers"; please see http://www.bkstephens.net.) Alt's thread problem asks for least-area…
There is currently a great deal of interest in the 4D-Var data assimilation scheme, in which one uses observational data to find the optimal initial condition for a differential equation by minimizing a cost function over the set of all…
This article began as a study of the structure of infinite permutation groups G in which point stabilisers are finite and all infinite normal subgroups are transitive. That led to two variations. One is the generalisation in which point…