Related papers: Fast error-controlling MOID computation for confoc…
In this paper, we study several important geometric optimization problems arising in machine learning. First, we revisit the Minimum Enclosing Ball (MEB) problem in Euclidean space $\mathbb{R}^d$. The problem has been extensively studied…
This paper gives simple distributed algorithms for the fundamental problem of computing graph distances in the Congested Clique model. One of the main components of our algorithms is fast matrix multiplication, for which we show an…
We investigate a method to compute a finite set of preliminary orbits for solar system bodies using the first integrals of the Kepler problem. This method is thought for the applications to the modern sets of astrometric observations, where…
Trajectory optimization of low-thrust perturbed orbit rendezvous is a crucial technology for space missions in low Earth orbits, which is difficult to solve due to its initial value sensitivity, especially when the transfer trajectory has…
Computing the minimum distance of a linear code is one of the fundamental problems in algorithmic coding theory. Vardy [14] showed that it is an \np-hard problem for general linear codes. In practice, one often uses codes with additional…
We establish numerical methods for solving the martingale optimal transport problem (MOT) - a version of the classical optimal transport with an additional martingale constraint on transport's dynamics. We prove that the MOT value can be…
In this paper we propose a fast optimization algorithm for approximately minimizing convex quadratic functions over the intersection of affine and separable constraints (i.e., the Cartesian product of possibly nonconvex real sets). This…
We present a novel method for deciding whether a given n-dimensional ellipsoid contains another one (possibly with a different center). This method consists in constructing a particular concave function and deciding whether it has any value…
A method to compute optimal collision avoidance maneuvers for short-term encounters is presented. The maneuvers are modeled as multiple-impulses to handle impulsive cases and to approximate finite burn arcs associated either with short…
Error bound analysis, which estimates the distance of a point to the solution set of an optimization problem using the optimality residual, is a powerful tool for the analysis of first-order optimization algorithms. In this paper, we use…
A simple and reliable algorithm for collision avoidance maneuvers (CAMs), capable of computing impulsive, multi-impulsive, and low-thrust maneuvers, is proposed. The probability of collision (PoC) is approximated by a polynomial of…
Computationally solving multi-marginal optimal transport (MOT) with squared Euclidean costs for $N$ discrete probability measures has recently attracted considerable attention, in part because of the correspondence of its solutions with…
In this paper, we propose a new algorithm based on radial symmetry center method to track colloidal particles close to contact, where the optical images of the particles start to overlap in digital video microscopy. This overlapping effect…
We propose a novel iterative process to establish the minimum separation between two ellipsoids. The method maintains one point on each surface and updates their locations in the theta-phi parametric space. The tension along the connecting…
The Earth Mover Distance (EMD) between two sets of points $A, B \subseteq \mathbb{R}^d$ with $|A| = |B|$ is the minimum total Euclidean distance of any perfect matching between $A$ and $B$. One of its generalizations is asymmetric EMD,…
This article proposes a modular optimal control framework for local three-dimensional ellipsoidal obstacle avoidance, exemplarily applied to model predictive path-following control. Static as well as moving obstacles are considered. Central…
A fundamental problem in computational geometry is to compute an obstacle-avoiding Euclidean shortest path between two points in the plane. The case of this problem on polygonal obstacles is well studied. In this paper, we consider the…
Given a simple polygon $P$ and a set $Q$ of points contained in $P$, we consider the geodesic $k$-center problem where we want to find $k$ points, called \emph{centers}, in $P$ to minimize the maximum geodesic distance of any point of $Q$…
We consider the minimal distance between orbits of measure preserving dynamical systems. In the spirit of dynamical shrinking target problems we identify distance rates for which almost sure asymptotic closeness properties can be ensured.…
Detecting elliptical objects from an image is a central task in robot navigation and industrial diagnosis where the detection time is always a critical issue. Existing methods are hardly applicable to these real-time scenarios of limited…