Related papers: Some methods for constructing new operator monoton…

In this article we show the following result: if $C$ is an $n$-dimensional convex and compact subset, $f:C\rightarrow[0,\infty)$ is concave, and $\phi:[0,\infty)\rightarrow[0,\infty)$ is a convex function with $\phi(0)=0$, we then…

The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…

Associativity of a two-place function $T: [0,1]^2\rightarrow [0,1]$ defined by $T(x,y)=f^{(-1)}(F(f(x),f(y)))$ where $F:[0,\infty]^2\rightarrow[0,\infty]$ is an associative function, $f: [0,1]\rightarrow [0,\infty]$ is a monotone function…

Replacing operators with continuous operator-valued functions, we prove time-dependent versions of well-known results on compressions and diagonals of bounded operators. The setting of smooth functions is also addressed. Our results have no…

For any densely defined, lower semi-continuous trace \tau on a C*-algebra A with mutually commuting C*-subalgebras A_1, A_2, ... A_n, and a convex function f of n variables, we give a short proof of the fact that the function (x_1, x_2,…

We say that a function is rare-case hard against a given class of algorithms (the adversary) if all algorithms in the class can compute the function only on an $o(1)$-fraction of instances of size $n$ for large enough $n$. Starting from any…

Let $E$ be a sublattice of a vector lattice $F$. A continuous operator $T$ from the vector lattice $E$ into a normed vector space $X$ is said to be $\tilde{o}$rder-norm continuous whenever $x_\alpha\xrightarrow{Fo}0$ implies…

In this article, we study exponents which preserve complete monotonicity of functions on lattices. We prove that for any completely monotone function $f$ on a finite lattice, $f^\alpha$ is completely monotone for all $\alpha\geq c$, where…

The \emph{Continuity Problem} is the question whether effective operators are continuous, where an effective operator $F$ is a function on a space of constructively given objects $x$, defined by mapping construction instructions for $x$ to…

Let's fix a reasonable subsystem $T$ of arithmetic; why are natural extensions of $T$ pre-well-ordered by consistency strength? In previous work, an approach to this question was proposed. The goal of this work was to classify the recursive…

We study multiply recurrent and hypercyclic operators as a special case of $\mathcal F$-hypercyclicity, where $\mathcal F$ is the family of subsets of the natural numbers containing arbitrarily long arithmetic progressions. We prove several…

A convex-polynomial is a convex combination of the monomials $\{1, x, x^2, \ldots\}$. This paper establishes that the convex-polynomials on $\mathbb R$ are dense in $L^p(\mu)$ and weak$^*$ dense in $L^\infty(\mu)$, precisely when…

Let a function $F: [0,1]^2\rightarrow [0,1]$ be given by $F(x,y)= f^{(-1)}(T(f(x), f(y)))$ where $f :[0,1]\rightarrow [0,1]$ is a monotone function, $f^{(-1)}$ is the pseudo-inverse of $f$ and $T$ is a triangular norm. This article…

This paper investigates first-order variable metric backward forward dynamical systems associated with monotone inclusion and convex minimization problems in real Hilbert space. The operators are chosen so that the backward-forward…

Finite Cartesian products of operators play a central role in monotone operator theory and its applications. Extending such products to arbitrary families of operators acting on different Hilbert spaces is an open problem, which we address…

We give a Jensen operator inequality for strongly convex functions. As a corollary, we improve operator Holder-McCarthy inequality under suitable conditions.

Integrally convex functions constitute a fundamental function class in discrete convex analysis, including M-convex functions, L-convex functions, and many others. This paper aims at a rather comprehensive survey of recent results on…

We give several new characterizations of completely monotone functions and Bernstein functions via two approaches: the first one is driven algebraically via elementary preserving mappings and the second one is developed in terms of the…

It is well known that a Lipschitz function on the real line does not have to be operator Lipschitz. We show that the situation changes dramatically if we pass to H\"older classes. Namely, we prove that if $f$ belongs to the H\"older class…

Time-varying optimization is fundamental to decision-making in dynamic environments, where objectives evolve over time due to exogenous signals or data streams. However, algorithms designed for static problems yield suboptimal decisions in…