Related papers: An invitation to the study of a uniqueness problem

We prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existence and uniqueness result for an optimal algorithm for…

Let f be local diffeomorphism between real Banach spaces. We prove that if the locally Lipschitz functional F(x)=1/2|f(x)-y|^2 satisfies the Chang Palais-Smale condition for all y in the target space of f, then f is a norm-coercive global…

Consider the differential equation $y'=F(x,y)$. We determine the weakest possible upper bound on $|F(x,y)-F(x,z)|$ which guarantees that this equation has for all initial values a unique solution, which exists globally.

We provide a unified framework for a systematic analysis of the existence of solutions to general nonconvex problems, relying on asymptotic and retractive cones for functions and sets. Using this framework we develop new necessary and…

A subequation on an open subset $X\subset \mathbb R^n$ is a subset $F$ of the space of $2$-jets on $X$ with certain properties. A smooth function is said to be $F$-subharmonic if all of its $2$-jets lie in $F$, and using the viscosity…

We present uniqueness results for enclosing ellipses of minimal area in the hyperbolic plane. Uniqueness can be guaranteed if the minimizers are sought among all ellipses with prescribed axes or center. In the general case, we present a…

We consider an optimal control problem subject to a semilinear elliptic PDE together with its variational discretization. We provide a condition which allows to decide whether a solution of the necessary first order conditions is a global…

We study the Riemannian distance function from a fixed point (a point-wise target) of Euclidean space in the presence of a compact obstacle bounded by a smooth hypersurface. First, we show that such a function is locally semiconcave with a…

This paper considers general rank-constrained optimization problems that minimize a general objective function $f(X)$ over the set of rectangular $n\times m$ matrices that have rank at most $r$. To tackle the rank constraint and also to…

We have an $\m\x\n$ real-valued arbitrary matrix $A$ (e.g. a dictionary) with $\m<\n$ and data $d$ describing the sought-after object with the help of $A$. This work provides an in-depth analysis of the (local and global) minimizers of an…

We prove the existence, uniqueness, and regularity of minimizers of a polyconvex functional in two and three dimensions, which corresponds to the $H^1$ projection of measure-preserving maps. Our result introduces a new criteria on the…

For each n,N>0 we construct a set of points x_1,...,x_M in D^n with the following property: if f is a rational inner function on D^n of degree strictly less than N and g is an analytic function mapping D^n to D that satisfies g(x_i)=f(x_i)…

Motivated by the Maximum Theorem for convex functions (in the setting of linear spaces) and for subadditive functions (in the setting of Abelian semigroups), we establish a Maximum Theorem for the class of generalized convex functions,…

Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…

One of the oldest and richest problems from continuous location science is the famous Fermat-Torricelli problem, asking for the unique point in Euclidean space that has minimal distance sum to n given (non-collinear) points. Many natural…

In this paper we define a new space, $LH(X,Y)$, consisting of functions $f\in X \subset Y$ (with $X,Y$ normed spaces) such that $\| f \|_X \equiv \| f \|_Y$ (where $\| \cdot \|_X$ is any norm on $X$, in general not the norm induced by $\|…

The problem of finding the minimizer of a sum of convex functions is central to the field of optimization. Thus, it is of interest to understand how that minimizer is related to the properties of the individual functions in the sum. In this…

Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper bound on the distance from the origin to a feasible point.…

Let E be a topological space and F a uniform space. We introduce a new topology (in fact a uniform structure) called the V-congergence on the space of applications from E to F such that C(E,F) is closed for this topology and the restriction…

We prove that any random variable $X$ whose moment generating function is point-wise upper bounded by that of $ G \sim \mathcal{N}(0,1) $ must be dominated by $ G/\mathbb{E}[|G|] $ in convex order, meaning $ \mathbb{E}[f(X)] \le…