Related papers: Nearest Points on Toric Varieties
We compute the divisor class group and the Picard group of projective varieties with Hibi rings as homogeneous coordinate rings. These varieties are precisely the toric varieties associated to order polytopes. We use tools from the theory…
Distance measuring is a very important task in digital geometry and digital image processing. Due to our natural approach to geometry we think of the set of points that are equally far from a given point as a Euclidean circle. Using the…
A new exact projective penalty method is proposed for the equivalent reduction of constrained optimization problems to nonsmooth unconstrained ones. In the method, the original objective function is extended to infeasible points by summing…
The Euler scheme is up to date the most important numerical method for ordinary differential inclusions, because the use of the available higher-order methods is prohibited by their enormous complexity after spatial discretization.…
For any (real) algebraic variety $X$ in a Euclidean space $V$ endowed with a nondegenerate quadratic form $q$, we introduce a polynomial $\mathrm{EDpoly}_{X,u}(t^2)$ which, for any $u\in V$, has among its roots the distance from $u$ to $X$.…
Many statistical and machine learning approaches rely on pairwise distances between data points. The choice of distance metric has a fundamental impact on performance of these procedures, raising questions about how to appropriately…
Let $v \ne 0$ be a vector in $\R^n$. Consider the Laplacian on $\R^n$ with drift $\Delta_{v} = \Delta + 2v\cdot \nabla$ and the measure $d\mu(x) = e^{2 \langle v, x \rangle} dx$, with respect to which $\Delta_{v}$ is self-adjoint. This…
This paper considers the projected gradient descent (PGD) algorithm for the problem of minimizing a continuously differentiable function on a nonempty closed subset of a Euclidean vector space. Without further assumptions, this problem is…
We present an approach over arbitrary fields to bound the degree of intersection of families of varieties in terms of how these concentrate on algebraic sets of smaller codimension. This provides in particular a substantial extension of the…
We study the obstruction degrees of translates of sub-tori of multiplicative tori and we show how they are connected to lower bounds for the essential minimum of these varieties. In particular, we combine our computations with results of A.…
A common approach to compute distances on continuous surfaces is by considering a discretized polygonal mesh approximating the surface and estimating distances on the polygon. We show that exact geodesic distances restricted to the polygon…
The paper suggests a new --- to the best of the author's knowledge --- characterization of decisions which are optimal in the multi-objective optimization problem with respect to a definite proper preference cone, a Euclidean cone with a…
Given a hypersurface in a complex projective space, we prove that the multidegrees of its toric polar map agree, up to sign, with the coefficients of the Chern-Schwartz-MacPherson class of a distinguished open set, namely the complement of…
We consider the fundamental task of optimising a real-valued function defined in a potentially high-dimensional Euclidean space, such as the loss function in many machine-learning tasks or the logarithm of the probability distribution in…
We study algebraic points of bounded degree on polarized projective varieties. To do so, we refine further the filtration construction and Subspace Theorem approach, for the study of integral points, which has origins in the work of…
Motivated by the concept of Euclidean Distance Degree, which measures the complexity of finding the nearest point to an algebraic set in Euclidean space, we introduce the notion of Grassmann Distance Complexity (GDC). This concept…
We consider variants of the classical Frank-Wolfe algorithm for constrained smooth convex minimization, that instead of access to the standard oracle for minimizing a linear function over the feasible set, have access to an oracle that can…
A toric code is an error-correcting code determined by a toric variety or its associated integral convex polytope. We investigate $4$- and $5$-dimensional toric $3$-fold codes, which are codes arising from polytopes in $\mathbf{R}^3$ with…
Collision detection plays an important role in simulation, control, and learning for robotic systems. However, no existing method is differentiable with respect to the configurations of the objects, greatly limiting the sort of algorithms…
Given a set of points in the Euclidean space $\mathbb{R}^\ell$ with $\ell>1$, the pairwise distances between the points are determined by their spatial location and the metric $d$ that we endow $\mathbb{R}^\ell$ with. Hence, the distance…