Results 11 to 20 of about 122,363 (269)
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
The main objective of this paper is to obtain certain new k-fractional estimates of Hermite−Hadamard type inequalities via s-convex functions of Breckner type essentially involving k-Appell’s hypergeometric functions.
Muhammad Uzair Awan +3 more
doaj +1 more source
The extensive 1-median problem with radius on networks [PDF]
The median location problem concerns finding locations of one or several new facilities that minimize the overall weighted distances from the existing to the new facilities.
Tran Hoai Ngoc Nhan +2 more
doaj +1 more source
Infinitesimal Convexity Implies Local Convexity [PDF]
(the tangent space at p) such that expU has no points of M onthe \inside" of L. By the inside of Lwe mean the component of a tubularneighbor hood with Ldeleted which corresponds to the negative multiplesof the orienting normal vector eld under exp. The exponential maps arethose of M.It is an immediate consequence of one of the standard interpretations ...
openaire +1 more source
Impact of Concave and Convex Solid Surfaces By Liquid-Like Projectiles
A theoretical and experimental investigation of the normal impact of a flat-ended liquid slug onto ductile cylindrical solid targets is presented. The liquid slug is simulated by wax which is known to behave as a liquid in high speed impact situations ...
Riyadh N. Kiter, Sabah A. L. Salem
doaj +1 more source
Non-Linear Inner Structure of Topological Vector Spaces
Inner structure appeared in the literature of topological vector spaces as a tool to characterize the extremal structure of convex sets. For instance, in recent years, inner structure has been used to provide a solution to The Faceless Problem and to ...
Francisco Javier García-Pacheco +3 more
doaj +1 more source

