相关论文: C*-Convexity of Norm Unit Balls

We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…

The notion of ball convexity, considered in finite dimensional real Banach spaces, is a natural and useful extension of usual convexity; one replaces intersections of half-spaces by suitable intersections of balls. A subset $S$ of a normed…

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

We study the algebraic and geometric structure related to tensor nuclear norms. We show that the unit ball of the nuclear norm is the convex hull of an irreducible real variety and give an explicit description of its real vanishing ideal.…

Let $C\subset {\mathbb R}^n$ be a convex body. We introduce two notions of convexity associated to C. A set $K$ is $C$-ball convex if it is the intersection of translates of $C$, or it is either $\emptyset$, or ${\mathbb R}^n$. The $C$-ball…

Whereas the norm of a vector measures amplitude (and is a 1-homogeneous function), sparsity is measured by the 0-homogeneous l0 pseudonorm, which counts the number of nonzero components. We propose a family of conjugacies suitable for the…

We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…

We investigate geometric features of the unit ball corresponding to the sum of the nuclear norm of a matrix and the $l_1$ norm of its entries --- a common penalty function encouraging joint low rank and high sparsity. As a byproduct of this…

We establish a maximum principle for a two-point function in order to analyze the convexity of level sets of harmonic functions. We show that this can be used to prove a strict convexity result involving the smallest principal curvature of…

In a paper published in 2020 in Studia Mathematica, Abrahamsen et al. proved that in the real space $L_1(\mu)$, where $\mu$ is a non-zero $\sigma$-finite (countably additive non-negative) measure, norm-one elements in finite convex…

We study a family of polytopes and their duals, that appear in various optimization problems as the unit balls for certain norms. These two families interpolate between the hypercube, the unit ball for the $\infty$-norm, and its dual…

Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…

We investigate the closed convex hull of unitary orbits of selfadjoint elements in arbitrary unital C*-algebras. Using a notion of majorization against unbounded traces, a characterization of these closed convex hulls is obtained.…

Let $m>1$ be an integer, $B_m$ the set of all unit vectors of $\Bbb R^m$ pointing in the direction of a nonzero integer vector of the cube $[-1, 1]^m$. Denote by $s_m$ the radius of the largest ball contained in the convex hull of $B_m$. We…

In the present paper, the following convexity principle is proved: any closed convex multifunction, which is metrically regular in a certain uniform sense near a given point, carries small balls centered at that point to convex sets, even…

For a unital $C^*$-algebra $\mathcal A$ and a subspace $\mathcal B$ of $\mathcal A$, a characterization for a best approximation to an element of $\mathcal A$ in $\mathcal B$ is obtained. As an application, a formula for the distance of an…

Let $p\in(1,n)$. If $\Omega$ is a convex domain in $\rn$ whose $p$-capacitary potential function $u$ is $(1-p)/(n-p)$-concave (i.e. $u^{(1-p)/(n-p)}$ is convex), then $\Omega$ is a ball.

Estimation of convex functions finds broad applications in engineering and science, while convex shape constraint gives rise to numerous challenges in asymptotic performance analysis. This paper is devoted to minimax optimal estimation of…

We establish a general criterion for the existence of convex sets of fixed shape as, e.g., balls of a given radius, of maximal probability on Banach spaces. We also provide counterexamples showing that their existence my fail even in some…

A polyhedron in a Banach space is a family of points $\mathcal{X}$ such that for every $x\in \mathcal{X}$, there is a closed convex set $C$ such that $a\notin C$ and $\mathcal{X}\setminus\{x\}\subset C$. In this article, we consider the…