Related papers: Self-scaled barrier functions on symmetric cones a…
Let $K$ be a convex body (a non-empty compact convex set) in $n$-dimensional Euclidean space. A set $B$ is called a barrier (or an `opaque set') for $K$ if every line that intersects $K$, also intersects $B$. Although this concept was…
Statistical problems often involve linear equality and inequality constraints on model parameters. Direct estimation of parameters restricted to general polyhedral cones, particularly when one is interested in estimating low dimensional…
This paper develops a complete foundational treatment of simplicial complexes from Euclidean spaces through geometric realizations, emphasizing concrete computations, examples, and practical verification methods. Beginning with finite point…
Valuations on the space of finite-valued convex functions on $\mathbb{C}^n$ that are continuous, dually epi-translation invariant, as well as $\mathrm{U}(n)$-invariant are completely classified. It is shown that the space of these…
Imposing additional constraints on low-rank optimization has garnered growing interest. However, the geometry of coupled constraints hampers the well-developed low-rank structure and makes the problem intricate. To this end, we propose a…
The region of entropic vectors is a convex cone that has been shown to be at the core of many fundamental limits for problems in multiterminal data compression, network coding, and multimedia transmission. This cone has been shown to be…
We provide a unified framework for a systematic analysis of the existence of solutions to general nonconvex problems, relying on asymptotic and retractive cones for functions and sets. Using this framework we develop new necessary and…
We develop a short-step interior point method to optimize a linear function over a convex body assuming that one only knows a membership oracle for this body. The approach is based on Abernethy and Hazan's sketch of a universal interior…
In this paper, we study a class of nonconvex and nonsmooth structured difference-of-convex (DC) programs, which contain in the convex part the sum of a nonsmooth linearly composed convex function and a differentiable function, and in the…
We characterise the affine span of the midpoints sets for Thompson's metric on symmetric cones in terms of a translation of the zero-component of the Peirce decomposition of an idempotent. As a consequence we derive an explicit formula for…
We investigate the semigroup of integer points inside a convex cone. We extend classical results in integer linear programming to integer conic programming. We show that the semigroup associated with nonpolyhedral cones can sometimes have a…
We give a generalization of the Jordan canonical form theorem for a class of bounded linear operators on complex separable Hilbert spaces in terms of direct integrals. Precisely, we study the uniqueness of strongly irreducible…
The metric projection onto the positive semidefinite (PSD) cone is strongly semismooth, a property that guarantees local quadratic convergence for many powerful algorithms in semidefinite programming. In this paper, we investigate whether…
Traditionally, most complex intelligence architectures are extremely non-convex, which could not be well performed by convex optimization. However, this paper decomposes complex structures into three types of nodes: operators, algorithms…
In 1969, Vic Klee asked whether a convex body is uniquely determined (up to translation and reflection in the origin) by its inner section function, the function giving for each direction the maximal area of sections of the body by…
Deciding whether saddle points exist or are approximable for nonconvex-nonconcave problems is usually intractable. This paper takes a step towards understanding a broad class of nonconvex-nonconcave minimax problems that do remain…
In this paper the notion of modular cone metric space is introduced and some properties of such spaces are investigated. Also we define convex modular cone metric which takes values in CR(Y) where Y is a compact Hausdorff space. Then a…
We give two characterizations of cones over ellipsoids in real normed vector spaces. Let $C$ be a closed convex cone with nonempty interior such that $C$ has a bounded section of codimension $1$. We show that $C$ is a cone over an ellipsoid…
We study the decomposition of 4d $\mathcal{N}=1$ gauge theories with Lie algebras of type $\mathfrak{su}(N)$, $\mathfrak{so}(2N)$, and $\mathfrak{e}_{6}$, realized via M-theory geometric engineering. These theories, together with their…
The irreducible characters of the symmetric group are a symmetric polynomial in the eigenvalues of a permutation matrix. They can therefore be realized as a symmetric function that can be evaluated at a set of variables and form a basis of…