Related papers: Basic Polyhedral Theory
Geometric duality theory for multiple objective linear programming problems turned out to be very useful for the development of efficient algorithms to generate or approximate the whole set of nondominated points in the outcome space. This…
The notions of convexity and convex polytopes are introduced in the setting of tropical geometry. Combinatorial types of tropical polytopes are shown to be in bijection with regular triangulations of products of two simplices. Applications…
Motivated by a long-standing conjecture of Polya and Szeg\"o about the Newtonian capacity of convex bodies, we discuss the role of concavity inequalities in shape optimization, and we provide several counterexamples to the…
Recent developments in set optimization are surveyed and extended including various set relations as well as fundamental constructions of a convex analysis for set- and vector-valued functions, and duality for set optimization problems.…
Kontsevich's formality theorem states that the differential graded Lie algebra of multidifferential operators on a manifold M is L-infinity-quasi-isomorphic to its cohomology. The construction of the L-infinity map is given in terms of…
This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…
The purpose of this paper is to give a self-contained overview of the theory of matrix convex sets and free spectrahedra. We will give new proofs and generalizations of key theorems. However we will also introduce various new concepts and…
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…
This is a report on aspects of the theory and use of monoidal categories. The first section introduces the main concepts through the example of the category of vector spaces. String notation is explained and shown to lead naturally to a…
We extend our generic rigidity theory for periodic frameworks in the plane to frameworks with a broader class of crystallographic symmetry. Along the way we introduce a new class of combinatorial matroids and associated linear…
This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…
By generalizing the Drinfeld-Sokolov reduction a large class of $W$ algebras can be constructed. We introduce 'finite' versions of these algebras by Poisson reducing Kirillov Poisson structures on simple Lie algebras. A closed and…
We survey some important results concerning the finite--dimensional representations of the loop algebra of a simple complex Lie algebra, and their twisted loop subalgebras. In particular, we review the parametrization and description of the…
This monograph is on convex real projective structures on strongly tame n-orbifolds with some appropriate conditions on ends.
In this paper we introduce the convex fragment of {\L}ukasiewicz Logic and discuss its possible applications in different learning schemes. Indeed, the provided theoretical results are highly general, because they can be exploited in any…
Multisymplectic geometry is an adequate formalism to geometrically describe first order classical field theories. The De Donder-Weyl equations are treated in the framework of multisymplectic geometry, solutions are identified as integral…
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…
In this paper, we provide an equivalent condition for the Chvatal-Gomory (CG) closure of a closed convex set to be finitely-generated. Using this result, we are able to prove that, for any closed convex set that can be written as the…
We introduce an axiomatic theory of spherical diagrams as a tool to study certain combinatorial properties of polyhedra in $\mathbb R^3$, which are of central interest in the context of Art Gallery problems for polyhedra and other…
Under study are some vector optimization problems over the space of Minkowski balls, i.e., symmetric convex compact subsets in Euclidean space. A typical problem requires to achieve the best result in the presence of conflicting goals;…