Related papers: A geometric simplex method in infinite-dimensional…
We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalize the correspondence of facets of a polytope to the vertices of the dual polytope to general semi-algebraic convex…
Although simplices are trivial from a linear optimization standpoint, the simplex algorithm can exhibit quite complex behavior. In this paper we study the behavior of max-slope pivot rules on (products of) simplices and describe the…
Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…
In this work, we propose a convenient framework for infinite-dimensional analysis (including both real and complex analysis in infinite dimensions), in which differentiation (in some weak sense) and integration operations can be easily…
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
We investigate the geography of Hilbert schemes parametrizing closed subschemes of projective space with specified Hilbert polynomials. We classify Hilbert schemes with unique Borel-fixed points via combinatorial expressions for their…
We develop a notion of rank one properly convex domains (or Hilbert geometries) in the real projective space. This is in the spirit of rank one non-positively curved Riemannian manifolds and CAT(0) spaces. We define rank one isometries for…
The earlier approach is used for description of qubits and geometric phase parameters, the things critical in the area of topological quantum computing. The used tool, Geometric (Clifford) Algebra is the most convenient formalism for that…
We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed…
We leverage the connections between nonexpansive maps, monotone Lipschitz operators, and proximal mappings to obtain near-optimal (i.e., optimal up to poly-log factors in terms of iteration complexity) and parameter-free methods for solving…
Projection methods aim to reduce the dimensionality of the optimization instance, thereby improving the scalability of high-dimensional problems. Recently, Sakaue and Oki proposed a data-driven approach for linear programs (LPs), where the…
We present a framework for modeling complex, high-dimensional distributions on convex polytopes by leveraging recent advances in discrete and continuous normalizing flows on Riemannian manifolds. We show that any full-dimensional polytope…
We give several new criteria to judge whether a simple convex polytope in a Euclidean space is combinatorially equivalent to a product of simplices. These criteria are mixtures of combinatorial, geometrical and topological conditions that…
We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…
A quadratically constrained quadratic programming problem is considered in a Hilbert space setting, where neither the objective nor the constraint are convex functions. Necessary and sufficient conditions are provided to guarantee that the…
Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…
Over the last two years, the canonical approach to quantum gravity based on connections and triads has been put on a firm mathematical footing through the development and application of a new functional calculus on the space of gauge…
We introduce a concept that generalizes several different notions of a "centerpoint" in the literature. We develop an oracle-based algorithm for convex mixed-integer optimization based on centerpoints. Further, we show that algorithms based…
We isolate a geometric mechanism that complements the dynamical suppression of macroscopic interference: In a high-dimensional Hilbert space, almost all state vectors are nearly orthogonal, accommodating an exponentially large reservoir of…