Results 11 to 20 of about 216,614 (289)
Inequalities via s−convexity and log −convexity
Topological Algebra and its Applications, 2017 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
Noncommutative Partial Convexity Via $$\Gamma $$-Convexity [PDF]
The Journal of Geometric Analysis, 2020 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
Biometrics, 2016 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]
Proceedings of the American Mathematical Society, 1968 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
Mathematical Programming, 2022 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]
Operators and Matrices, 2017 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
Drones, 2023 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
Classical and strong convexity of sublevel sets and application to attainable sets of nonlinear systems [PDF]
, 2014 Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented.
Reissig, Gunther, Weber, Alexander
core +2 more sources
(Average-) convexity of common pool and oligopoly TU-games [PDF]
, 2000 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
Geometric Properties of Generalized Integral Operators Related to The Miller–Ross Function
Axioms, 2023 It is very well-known that the special functions and integral operators play a vital role in the research of applied and mathematical sciences. In this paper, our aim is to present sufficient conditions for the families of integral operators containing ...
Sercan Kazımoğlu +2 more
doaj +1 more source