Related papers: Certificates of convexity for basic semi-algebraic…
In conic linear programming -- in contrast to linear programming -- the Lagrange dual is not an exact dual: it may not attain its optimal value, or there may be a positive duality gap. The corresponding Farkas' lemma is also not exact (it…
Polyhedra form an established abstract domain for inferring runtime properties of programs using abstract interpretation. Computations on them need to be certified for the whole static analysis results to be trusted. In this work, we look…
We prove that two dimensional convex subsets of spherical buildings are either buildings or have a center.
In this paper, two parallel notions of convexity of sets are introduced in the abelian semigroup setting. The connection of these notions to algebraic and to set-theoretic operations is investigated. A formula for the computation of the…
In a recent paper by L. Fel two new identities for the degree of syzygies are given. We present an algebraic proof of them, using only basic homological algebra tools. We also extend these results.
In this paper we introduce and study the concept of set extremality for systems of convex sets in vector spaces without topological structures. Characterizations of the extremal systems of sets are obtained in the form of the convex…
Why is it that semidefinite relaxations have been so successful in numerous applications in computer vision and robotics for solving non-convex optimization problems involving rotations? In studying the empirical performance we note that…
Certifying verification algorithms not only return whether a given property holds or not, but also provide an accompanying independently checkable certificate and a corresponding witness. The certificate can be used to easily validate the…
The accurate representation of epistemic uncertainty is a challenging yet essential task in machine learning. A widely used representation corresponds to convex sets of probabilistic predictors, also known as credal sets. One popular way of…
Given an $\mathcal{H}$-polytope $P$ and a $\mathcal{V}$-polytope $Q$, the decision problem whether $P$ is contained in $Q$ is co-NP-complete. This hardness remains if $P$ is restricted to be a standard cube and $Q$ is restricted to be the…
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…
We establish sufficient conditions for finite convergence of the alternating projections method for two non-intersecting and potentially nonconvex sets. Our results are based on a generalization of the concept of intrinsic transversality,…
An algorithm which computes a solution of a set optimization problem is provided. The graph of the objective map is assumed to be given by finitely many linear inequalities. A solution is understood to be a set of points in the domain…
The 2-sets convex feasibility problem aims at finding a point in the intersection of two closed convex sets $A$ and $B$ in a normed space $X$. More generally, we can consider the problem of finding (if possible) two points in $A$ and $B$,…
A set in the Euclidean plane is said to be biconvex if, for some angle $\theta\in[0,\pi/2)$, all its sections along straight lines with inclination angles $\theta$ and $\theta+\pi/2$ are convex sets (i.e, empty sets or segments).…
A semisimplicial set has face maps but not degeneracies. A basic fact, due to Rourke and Sanderson, is that a semisimplicial set satisfying the Kan condition can be given a simplicial structure. The present paper gives a combinatorial proof…
This paper studies convex sets categorically, namely as algebras of a distribution monad. It is shown that convex sets occur in two dual adjunctions, namely one with preframes via the Boolean truth values {0,1} as dualising object, and one…
The convexity number of a set $X \subset \mathbb{R}^2$ is the minimum number of convex subsets required to cover it. We study the following question: what is the largest possible convexity number $f(n)$ of $\mathbb{R}^2 \setminus S$, where…
A real square matrix is algebraically positive if there exists a real polynomial $f$ such that $f(A)$ is a positive matrix. In this paper, we give a sufficient condition for a sign pattern matrix to allow algebraic positivity, and give some…
The method of rational function certification for proving terminating hypergeometric identities is extended from single sums or integrals to multi-integral/sums and ``$q$'' integral/sums.