Let $\mathcal{K}$ be a $pointed$ rational cone in $\mathbb{R}^d$ with extremal rays generated by $r_1,r_2,\dots, r_m\in \mathbb{Z}^d$.
Here, pointed means that all $r_i$ lie strictly on one side of ...

Given a polyhedral cone, its intersection with any two-dimensional plane is either a polygon or a region enclosed by a polygonal curve. Is it a characterization of polyhedral cones? Does there exists ...

In a paper I'm refereeing, the authors make use of the following geometric fact:
Let $U$ be an open subset of $\mathbb{R}^2$. If there is a point $p\in \partial U$ so that $\partial U \backslash p$ ...

This question consists of two parts. I'm not breaking it up into two separate ones because posing the second question would essentially require me two rewrite the first one. Also, to some extent, the ...

Let $\mu$ be a probability measure on a subset $C \subset \mathbb{R}^\infty$ of the space of sequences, and assume, for simplicity, that $C$ is closed and convex.
We say that $\mu$ admits shifts if ...

The motivation for this question comes from this paper where we study lower bounds on the complexity of convex optimization algorithms (BTW, if you find a better title for my question, please let me ...

For a set $S \subseteq \mathbb{R}^n$ and a point $x \in \mathbb{R}^n$, let $c_S(x)$ be the point $s \in S$ that minimizes $\|x-s\|$ if such a point exists and is uniquely determined. It is known that ...

I want to prove that "For any $(2k-1)$-dimensional ellipsoid $E$ ,there is a $k$-flat $L$ passing through the center of $E$ such that $ E \cap L$ is a Euclidean ball. I see a proof for it in the book ...

Suppose $X$ is a strictly convex Banach space. Does there exist a bounded closed convex set $K$ in $X$ such that the set of all Chebyshev centers $C(K)$ of $K$ is a proper subset of $K$ with diameter ...

Let $V$ be a finite-dimensional vector space with an inner-product $(,)$ and let $C\subset V$ be a cone in $V$. Let $C^\vee$ denote the dual of $C$ with respect to $(,)$, i.e., the set of vector $v\in ...

This question is related to an orthant-type simplex in $\mathbb{R}^n$, which can be defined as
$$ S = \{x\in\mathbb{R}_{+}^n: \sum_{i=1}^nx_i \leq 1\}=\overline{\mbox{conv}}(0,e_1,\ldots,e_n). $$
For ...

From Minimax theorems, we roughly know that if $f(x,y)$ is convex on $X$ and concave $Y$ for both compact $X,Y$, then:
$$
\max_{x\in X}\min_{y\in Y} f(x,y)=\min_{y\in Y}\max_{x\in X} f(x,y).
$$
We can ...

Consider a polytope in $n$ dimensions defined by a set of linear constraints:
$$P = \{x \in \mathbb{R}^n : Ax \leq b\}$$
where A is some $m \times n$ constraint matrix, and $b = (b_1,\ldots,b_m)$ is ...

It is known that every convex function $f: \Omega\to \mathbb{R}$, $\Omega$ convex subset of $\mathbb{R}^n$, has a weak derivative of bounded variation $Df\in BV_{loc}(\mathbb{R}^n)$ (e.g. Evans and ...