Related papers: Tolerance Analysis by Polytopes
The problem of finding a point in the intersection of closed sets can be solved by the method of alternating projections and its variants. It was shown in earlier papers that for convex sets, the strategy of using quadratic programming (QP)…
Given a graph G, we construct a convex polytope whose face poset is based on marked subgraphs of G. Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of…
This study investigates the steady Boltzmann equation in one spatial variable for a polyatomic single-component gas in a half-space. Inflow boundary conditions are assumed at the half-space boundary, where particles entering the half-space…
This paper examines the global convergence problem of SLAM algorithms, an issue that faces topological obstructions. This is because the state-space of attitude dynamics is defined on a non-contractible manifold: the special orthogonal…
Under what circumstances does the ``closeness" of two functions imply the ``closeness" of their respective sublevel sets? In this paper, we answer this question by showing that if a sequence of functions converges strictly from above/below…
We provide formulas for projectors onto a polyhedral set, i.e. the intersection of a finite number of halfspaces. To this aim we formulate the problem of finding the projection as a convex optimization problem and we solve explicitly…
A half-space problem of a linear kinetic equation for gas molecules physisorbed close to a solid surface, relevant to a kinetic model of gas-surface interactions and derived by Aoki et al. [K.~Aoki et al., in: Phys. Rev. E 106:035306,…
Sumset estimates, which provide bounds on the cardinality of sumsets of finite sets in a group, form an essential part of the toolkit of additive combinatorics. In recent years, probabilistic or entropic analogs of many of these…
Although shape correspondence is a central problem in geometry processing, most methods for this task apply only to two-dimensional surfaces. The neglected task of volumetric correspondence--a natural extension relevant to shapes extracted…
We study the set of linear subspaces of a fixed dimension intersecting a given polytope. To describe this set as a semialgebraic subset of a Grassmannian, we introduce a Schubert arrangement of the polytope, defined by the Chow forms of the…
In this paper, the mixed Lp-surface area measures are defined and the mixed Lp Minkowski inequality is obtained consequently. Furthermore, the mixed Lp projection inequality for mixed projection bodies is established.
A key task in multi-objective optimization is to compute the Pareto subset or frontier $P$ of a given $d$-dimensional objective space $F$; that is, a maximal subset $P\subseteq F$ such that every element in $P$ is not-dominated (it is not…
In this paper, we study a partially overdetermined mixed boundary value problem in a half ball. We prove that a domain in which this partially overdetermined problem admits a solution if and only if the domain is a spherical cap…
We apply a new and mathematically rigorous method for the quantization of constrained systems to two-dimensional gauge theories. In this method, which quantizes Marsden-Weinstein symplectic reduction, the inner product on the physical state…
We propose to derive deviation measures through the Minkowski gauge of a given set of acceptable positions. We show that, given a suitable acceptance set, any positive homogeneous deviation measure can be accommodated in our framework. In…
We study the linear convergence of Frank-Wolfe algorithms over product polytopes. We analyze two condition numbers for the product polytope, namely the \emph{pyramidal width} and the \emph{vertex-facet distance}, based on the condition…
An approach to complex interpolation of compact subsets of $\Bbb C^n$, including Brunn-Minkowski type inequalities for the capacities of the interpolating sets, was developed recently by means of plurisubharmonic geodesics between relative…
We present a method for rewriting dimensionally regulated Feynman parameter integrals in the Minkowski regime as a sum of real, positive integrands multiplied by complex prefactors. This representation eliminates the need for contour…
We propose a method for solving constrained fixed point problems involving compositions of Lipschitz pseudo contractive and firmly nonexpansive operators in Hilbert spaces. Each iteration of the method uses separate evaluations of these…
We study the boundedness of composition operators on the weighted Bergman spaces and the Hardy space over the polydisc. For arbitrary polydisc we prove the rank sufficiency theorem which, in particular, provides us with a simple criterion…