Related papers: Projection and Convolution Operations for Integral…

Convexity and convex functions play an important role in theoretical physics. To initiate a study of the possible uses of convex functions in General Relativity, we discuss the consequences of a spacetime $(M,g_{\mu \nu})$ or an initial…

The notion of ordinal concavity of utility functions has recently been considered by Hafalir, Kojima, Yenmez, and Yokote in economics while there exist earlier related works in discrete optimization and operations research. In the present…

We explore the relationship between convex and subharmonic functions on discrete sets. Our principal concern is to determine the setting in which a convex function is necessarily subharmonic. We initially consider the primary notions of…

We define a generalization of convex functions, which we call $\delta$-convex functions, and show they must satisfy interior H\"older and $W^{1,p}$ estimates. As an application, we consider solutions of a certain class of fully nonlinear…

In this article we utilise abstract convexity theory in order to unify and generalize many different concepts from nonsmooth analysis. We introduce the concepts of abstract codifferentiability, abstract quasidifferentiability and abstract…

We construct an example of a smooth convex function on the plane with a strict minimum at zero, which is real analytic except at zero, for which Thom's gradient conjecture fails both at zero and infinity. More precisely, the gradient orbits…

A complete classification of continuous, dually epi-translation invariant, and rotation equivariant valuations on convex functions is established. This characterizes the recently introduced functional Minkowski vectors, which naturally…

We introduce new global and local inexact oracle concepts for a wide class of convex functions in composite convex minimization. Such inexact oracles naturally come from primal-dual framework, barrier smoothing, inexact computations of…

We present a closed-form finite-dimensional projection method for regularizing a function defined by a discrete set of measurement data, which have been contaminated by random, zero mean errors, and for estimating the derivative and…

This work is devoted to a systematic study of symplectic convexity for integrable Hamiltonian systems with elliptic and focus-focus singularities. A distinctive feature of these systems is that their base spaces are still smooth manifolds…

We study the convolution of functions of the form \[ f_\alpha (z) := \dfrac{\left( \frac{1 + z}{1 - z} \right)^\alpha - 1}{2 \alpha}, \] which map the open unit disk of the complex plane onto polygons of 2 edges when $\alpha\in(0,1)$. We…

We consider the space of convex functions defined in the Euclidean $n$-dimensional space, which are lower semi-continuous and tend to infinity at infinity. We study real-valued valuations defined on this space of functions, which are…

The deprojection of axisymmetric density distributions is generally indeterminate to within the addition of certain axisymmetric distributions (konus densities) that are invisible in projection. The known class of konus densities is…

Mixed volumes, which are the polarization of volume with respect to the Minkowski addition, are fundamental objects in convexity. In this note we announce the construction of mixed integrals, which are functional analogs of mixed volumes.…

In this article, we further explore convex functions by revealing new bounds, resulting from stronger convexity behavior. In particular, we define the so called radical convex functions and study their properties. We will see that such…

The convex feasibility problem (CFP) is to find a feasible point in the intersection of finitely many convex and closed sets. If the intersection is empty then the CFP is inconsistent and a feasible point does not exist. However,…

In this paper we give an integral representation of an $n$-convex function $f$ in general case without additional assumptions on function $f$. We prove that any $n$-convex function can be represented as a sum of two $(n+1)$-times monotone…

We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation…

In this paper, we explore a broad class of constrained saddle point problems with a bilevel structure, wherein the upper-level objective function is nonconvex-concave and smooth over compact and convex constraint sets, subject to a strongly…

Convolution is conventionally defined as a linear operation on functions of one or more variables which commutes with shifts. Group convolution generalizes the concept to linear operations on functions of group elements representing more…