Strict convexity of the objective function and uniqueness of the maximum point in a model with three arbitrary random priorities

The main result of this paper is the proof of the strict concavity of some function of integral form depending on three random variables, which we call priorities. This function is an objective function in the so-called model with priorities, in which the arbiter, following expert opinions, distributes funds among the enterprises and institutions under his jurisdiction. This result implies an important corollary about the existence and uniqueness of a local maximum point (which is also a global maximum point) of the objective function. This is a significant generalization of the corresponding result of N.V. Neumezhitskaia, S.I. Uglich and T.A. Volosatova, published in December 2020.

Some Aspects of Geometric Constants in Modular Spaces

In this paper, we generalize the typical geometric constants of Banach spaces to modular spaces. We study the equivalence between the convexity of modular and normed spaces, and obtain the relationship between ρ-Neumann-Jordan constant and ρ-James constant. In particular, we extend the convexity and smoothness modular, and obtain the criterion theorems of the uniform convexity and strict convexity.

Computation of optimal transport with finite volumes

We construct Two-Point Flux Approximation (TPFA) finite volume schemes to solve the quadratic optimal transport problem in its dynamic form, namely the problem originally introduced by Benamou and Brenier. We show numerically that these type of discretizations are prone to form instabilities in their more natural implementation, and we propose a variation based on nested meshes in order to overcome these issues. Despite the lack of strict convexity of the problem, we also derive quantitative estimates on the convergence of the method, at least for the discrete potential and the discrete cost. Finally, we introduce a strategy based on the barrier method to solve the discrete optimization problem.

A Characterization of a Local Vector Valued Bollobás Theorem

In this paper, we are interested in giving two characterizations for the so-called property L$$_{o,o}$$ o , o , a local vector valued Bollobás type theorem. We say that (X, Y) has this property whenever given $$\varepsilon > 0$$ ε > 0 and an operador $$T: X \rightarrow Y$$ T : X → Y , there is $$\eta = \eta (\varepsilon , T)$$ η = η ( ε , T ) such that if x satisfies $$\Vert T(x)\Vert > 1 - \eta $$ ‖ T ( x ) ‖ > 1 - η , then there exists $$x_0 \in S_X$$ x 0 ∈ S X such that $$x_0 \approx x$$ x 0 ≈ x and T itself attains its norm at $$x_0$$ x 0 . This can be seen as a strong (although local) Bollobás theorem for operators. We prove that the pair (X, Y) has the L$$_{o,o}$$ o , o for compact operators if and only if so does $$(X, \mathbb {K})$$ ( X , K ) for linear functionals. This generalizes at once some results due to D. Sain and J. Talponen. Moreover, we present a complete characterization for when $$(X \widehat{\otimes }_\pi Y, \mathbb {K})$$ ( X ⊗ ^ π Y , K ) satisfies the L$$_{o,o}$$ o , o for linear functionals under strict convexity or Kadec–Klee property assumptions in one of the spaces. As a consequence, we generalize some results in the literature related to the strongly subdifferentiability of the projective tensor product and show that $$(L_p(\mu ) \times L_q(\nu ); \mathbb {K})$$ ( L p ( μ ) × L q ( ν ) ; K ) cannot satisfy the L$$_{o,o}$$ o , o for bilinear forms.

On Fermat-Torricelli Problem in Frechet Spaces

We study the Fermat-Torricelli problem (FTP) for Frechet space X, where X is considered as an inverse limit of projective system of Banach spaces. The FTP is defined by using fixed countable collection of continuous seminorms that defines the topology of X as gauges. For a finite set A in X consisting of n distinct and fixed points, the set of minimizers for the sum of distances from the points in A to a variable point is considered. In particular, for the case of collinear points in X, we prove the existence of the set of minimizers for FTP in X and for the case of non collinear points, existence and uniqueness of the set of minimizers are shown for reflexive space X as a result of strict convexity of the space.

Deducing a Variational Principle with Minimal A Priori Assumptions

We study the well-known variational and large deviation principle for graph homomorphisms from $\mathbb{Z}^m$ to $\mathbb{Z}$. We provide a robust method to deduce those principles under minimal a priori assumptions. The only ingredient specific to the model is a discrete Kirszbraun theorem i.e. an extension theorem for graph homomorphisms. All other ingredients are of a general nature not specific to the model. They include elementary combinatorics, the compactness of Lipschitz functions, and a simplicial Rademacher theorem. Compared to the literature, our proof does not need any other preliminary results like e.g. concentration or strict convexity of the local surface tension. Therefore, the method is very robust and extends to more complex and subtle models, as e.g. the homogenization of limit shapes or graph-homomorphisms to a regular tree.

The Engulfing Property from a Convex Analysis Viewpoint

In this note, we provide a simple proof of some properties enjoyed by convex functions having the engulfing property. In particular, making use only of results peculiar to convex analysis, we prove that differentiability and strict convexity are conditions intrinsic to the engulfing property.