Results 11 to 20 of about 951,322 (313)
"Convex" characterization of linearly convex domains [PDF]
MATHEMATICA SCANDINAVICA, 2011 We prove that a $C^{1,1}$-smooth bounded domain $D$ in $\C^n$ is linearly convex if and only if the convex hull of any two discs in $D$ with common center lies in $D.$Comment: to appear in Math.
Nikolov, Nikolai, Thomas, Pascal J.
core +6 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 ...
David Gale +2 more
openaire +2 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.
Genevera I. Allen +2 more
openaire +4 more sources
On Column-Convex and Convex Carlitz Polyominoes [PDF]
Mathematics in Computer Science, 2021 In this paper, we introduce and study {\it Carlitz polyominoes}. In particular, we show that, as $n$ grows to infinity, asymptotically the number of \begin{enumerate} \item column-convex Carlitz polyominoes with perimeter $2n$ is \beq \frac{9\sqrt{2}(14+3\sqrt{3})}{2704\sqrt{ n^3}}4^n. \feq \item convex Carlitz polyominoes with perimeter $2n$ is \beq \
Armend Shaban Shabani +3 more
openaire +3 more sources
A convex polynomial that is not sos-convex [PDF]
Mathematical Programming, 2011 15 ...
Pablo A. Parrilo, Amir Ali Ahmadi
openaire +3 more sources
On the moduli of convexity [PDF]
Proceedings of the American Mathematical Society, 2007 [EN] It is known that, given a Banach space (X, parallel to center dot parallel to), the modulus of convexity associated to this space delta X is a non-negative function, nondecreasing, bounded above by the modulus of convexity of any Hilbert space and satisfies the equation delta x(epsilon)/epsilon(2)
Guirao Sánchez, Antonio José +1 more
openaire +4 more sources
On φ-convexity of convex functions
Linear Algebra and its Applications, 1998 The authors construct a non-trivial set \(\Phi\) of extended-real valued functions on \(R^n\) containing all affine functions, such that an extended-real valued function defined on \(R^n\) is convex if and only if it is \(\Phi\)-convex, i.e., it is the pointwise supremum of some subset of \(\Phi\). They also prove a new sandwich theorem.
Ivan Singer +1 more
openaire +3 more sources
Frontiers in Robotics and AI, 2022 We present a joint multi-robot trajectory optimizer that can compute trajectories for tens of robots in aerial swarms within a small fraction of a second.
Dipanwita Guhathakurta +4 more
doaj +1 more source
The extensive 1-median problem with radius on networks [PDF]
Opuscula Mathematica, 2023 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
Convex Defining Functions for Convex Domains [PDF]
Journal of Geometric Analysis, 2010 21 ...
Jeffery D. McNeal, A. K. Herbig
openaire +4 more sources