Related papers: Relationships between Polyhedral Convex Sets and G…
The supersymmetric Poisson Sigma model is studied as a possible worldsheet realization of generalized complex geometry. Generalized complex structures alone do not guarantee non-manifest N=(2,1) or N=(2,2) supersymmetry, but a certain…
We provide a solution method for the polyhedral convex set optimization problem, that is, the problem to minimize a set-valued mapping with polyhedral convex graph with respect to a set ordering relation which is generated by a polyhedral…
We provide a simple proof for the Fenchel duality between strong convexity and Lipschitz continuous gradient. To this end, we first establish equivalent conditions of convexity for a general function that may not be differentiable. By…
While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…
A polarity notion for sets in a Banach space is introduced in such a way that the second polar of a set coincides with the smallest strongly convex set with respect to R that contains it. Strongly convex sets are characterized in terms of…
Farkas' lemma is an ubiquitous tool in optimisation, as it provides necessary and sufficient conditions to have $b \in A(P)$, where $P$ is a closed convex cone, $A$ is a (continuous) linear mapping and $b$ is a fixed vector. The standard…
Efficient representations of convex sets are of crucial importance for many algorithms that work with them. It is well-known that sometimes, a complicated convex set can be expressed as the projection of a much simpler set in higher…
Let $G = V, E$ be a simple connected undirected graph. A set $X \subseteq V$ is \emph{geodesically convex} if for any pair of vertices $x, y \in X$, all vertices on all shortest paths in $G$ from $x$ to $y$ are contained in $X$. A set $H…
Convex polyhedra are the basis for several abstractions used in static analysis and computer-aided verification of complex and sometimes mission critical systems. For such applications, the identification of an appropriate…
It is well known that correlations predicted by quantum mechanics cannot be explained by any classical (local-realistic) theory. The relative strength of quantum and classical correlations is usually studied in the context of Bell…
For a given set of $n\times n$ matrices $\mathcal F$, we study the union of the $C$-numerical ranges of the matrices in the set $\mathcal F$, denoted by $W_C({\mathcal F})$. We obtain basic algebraic and topological properties of…
We study the integrality gap of convex mixed-integer programs, that is, the difference between the optimal value of such a problem and the optimal value of its continuous relaxation. We study classes of convex sets whose associated…
We provide fundamental results on positive solutions to parametrized systems of generalized polynomial $\textit{inequalities}$ (with real exponents and positive parameters), including generalized polynomial $\textit{equations}$. In doing…
This paper focuses on investigating generalized relative interior notions for sets in locally convex topological vector spaces with particular attentions to graphs of set-valued mappings and epigraphs of extended-real-valued functions. We…
If the complement of a closed convex set in a closed convex cone is bounded, then this complement minus the apex of the cone is called a coconvex set. Coconvex sets appear in singularity theory (they are closely related to Newton diagrams)…
Generalized symmetries (also known as categorical symmetries) is a newly developing technique for studying quantum field theories. It has given us new insights into the structure of QFT and many new powerful tools that can be applied to the…
We study a special class of non-convex quadratic programs subject to two (possibly indefinite) quadratic constraints when the level sets of the constraint functions are {\it not} arranged {\it alternatively.} It is shown in the paper that…
The theory of intrinsic volumes of convex cones has recently found striking applications in areas such as convex optimization and compressive sensing. This article provides a self-contained account of the combinatorial theory of intrinsic…
We present a concise proof for the supporting hyperplane theorem. We then observe that the proof not only establishes the supporting hyperplane theorem but also extends it to a hyperplane separation theorem for certain non-convex sets. The…
While intersections of convex sets are convex, their unions have rather complicated behavior. Some natural contexts where they appear include duality arguments involving boundaries of convex sets and valuations, which have an Euler…