Results 11 to 20 of about 217,821 (286)
Inequalities via s−convexity and log −convexity
In this paper, we obtain some new inequalities for functions whose second derivatives’ absolute value is s−convex and log −convex. Also, we give some applications for numerical integration.
Akdemir Ahmet Ocak +2 more
doaj +5 more sources
The notions of convexity and convex polytopes are introduced in the setting of tropical geometry. Combinatorial types of tropical polytopes are shown to be in bijection with regular triangulations of products of two simplices.
Develin, Mike, Sturmfels, Bernd
core +6 more sources
Noncommutative Partial Convexity Via $$\Gamma $$-Convexity [PDF]
Motivated by classical notions of partial convexity, biconvexity, and bilinear matrix inequalities, we investigate the theory of free sets that are defined by (low degree) noncommutative matrix polynomials with constrained terms. Given a tuple of symmetric polynomials $\Gamma$, a free set is called $\Gamma$-convex if it closed under isometric ...
Jury, Michael +4 more
openaire +3 more sources
SummaryIn the biclustering problem, we seek to simultaneously group observations and features. While biclustering has applications in a wide array of domains, ranging from text mining to collaborative filtering, the problem of identifying structure in high-dimensional genomic data motivates this work.
Chi, Eric C. +2 more
openaire +4 more sources
Convex Functions on Convex Polytopes [PDF]
The behavior of convex functions is of interest in connection with a wide variety of optimization problems. It is shown here that this behavior is especially simple, in certain respects, when the domain is a polytope or belongs to certain classes of sets closely related to polytopes; moreover, the polytopes and related classes are actually ...
Gale, David +2 more
openaire +1 more source
AbstractWe present a generalization of the notion of neighborliness to non-polyhedral convex cones. Although a definition of neighborliness is available in the non-polyhedral case in the literature, it is fairly restrictive as it requires all the low-dimensional faces to be polyhedral.
James Saunderson, Venkat Chandrasekaran
openaire +4 more sources
Convex-cyclic matrices, convex-polynomial interpolation and invariant convex sets [PDF]
We define a convex-polynomial to be one that is a convex combination of the monomials $\{1, z, z^2, \ldots\}$. This paper explores the intimate connection between peaking convex-polynomials, interpolating convex-polynomials, invariant convex sets, and the dynamics of matrices.
Feldman, Nathan S., McGuire, Paul
openaire +2 more sources
On the solvability of a class of nonlinear Hammerstein integral equations on the semiaxis [PDF]
The paper studies a class of nonlinear integral equations on the semiaxis with a non-compact Hammerstein operator. It is assumed that the kernel of the equation decreases exponentially on the positive part of the number axis. Equations of this kind arise
Khachatryan, Khachatur Agavardovich +1 more
doaj +1 more source
(Average-) convexity of common pool and oligopoly TU-games [PDF]
The paper studies both the convexity and average-convexity properties for a particular class of cooperative TU-games called common pool games. The common pool situation involves a cost function as well as a (weakly decreasing) average joint production ...
Driessen, T.S.H., Meinhardt, H.
core +4 more sources
In this paper, we address the challenge of low recognition rates in existing methods for radar signals from unmanned aerial vehicles (UAV) with low signal-to-noise ratios (SNRs).
Xuemin Liu +5 more
doaj +1 more source

