Results 31 to 40 of about 217,821 (286)
On the spherical convexity of quadratic functions [PDF]
In this paper we study the spherical convexity of quadratic functions on spherically convex sets. In particular, conditions characterizing the spherical convexity of quadratic functions on spherical convex sets associated to the positive orthants and ...
Ferreira, O. P., Németh, S. Z.
core +2 more sources
Convexity arbitrage – the idea which does not work
Algorithmic trading, so popular nowadays, uses many strategies that are algorithmizable and promise profitability. This research answers the question whether it is possible to successfully use a convexity arbitrage strategy in a bond portfolio in ...
Bohumil Stádník
doaj +1 more source
Near Convexity, Metric Convexity, and Convexity
Many aspects of convexity in a normed space, hidden by the classical use of the obscure principle of excluded middle, are only revealed by a constructive approach. This paper studies various types of convexity, introducing several new concepts; it uses methods proposed by \textit{E.\,A.\thinspace Bishop} in Chapter~1 of ``A Constructivist Manifesto ...
openaire +3 more sources
SOME NEW GENERALIZATIONS OF HADAMARD–TYPE MIDPOINT INEQUALITIES INVOLVING FRACTIONAL INTEGRALS
In this study, we formulate the identity and obtain some generalized inequalities of the Hermite–Hadamard type by using fractional Riemann–Liouville integrals for functions whose absolute values of the second derivatives are convex.
B. Bayraktar
doaj +1 more source
For a function defined on a convex set in a Euclidean space, midpoint convexity is the property requiring that the value of the function at the midpoint of any line segment is not greater than the average of its values at the endpoints of the line ...
Moriguchi, Satoko +3 more
core +1 more source
Remarks on the abelian convexity theorem
This note contains some observations on abelian convexity theorems. Convexity along an orbit is established in a very general setting using Kempf-Ness functions.
Biliotti, Leonardo, Ghigi, Alessandro
core +1 more source
Equivalence of Informations Characterizes Bregman Divergences
Bregman divergences form a class of distance-like comparison functions which plays fundamental roles in optimization, statistics, and information theory.
Philip S. Chodrow
doaj +1 more source
Convexity of the zeros of some orthogonal polynomials and related functions
We study convexity properties of the zeros of some special functions that follow from the convexity theorem of Sturm. We prove results on the intervals of convexity for the zeros of Laguerre, Jacobi and ultraspherical polynomials, as well as functions ...
Ahmed +17 more
core +1 more source
Markov convexity and nonembeddability of the Heisenberg group [PDF]
We compute the Markov convexity invariant of the continuous infinite dimensional Heisenberg group $\mathbb{H}_\infty$ to show that it is Markov 4-convex and cannot be Markov $p$-convex for any $p < 4$.
Li, Sean
core +4 more sources
Many interesting problems are obtained by attempting to generalize classical results on convexity in Euclidean spaces to other convexity spaces, in particular to convexity spaces on graphs. In this paper we consider $P_3$-convexity on graphs.
Letzter, Shoham
core

