Related papers: Finding a best approximation pair of points for tw…
This paper focuses on the best approximation in quasi-cone metric spaces, a combination of quasi-metrics and cone metrics, which generalizes the notion of distance by allowing it to take values in an ordered Banach space. We explore the…
For a polyhedron $P$ in $\mathbb{R}^d$, denote by $|P|$ its combinatorial complexity, i.e., the number of faces of all dimensions of the polyhedra. In this paper, we revisit the classic problem of preprocessing polyhedra independently so…
The task of approximating points with circular arcs is performed in many applications, such as polyline compression, noise filtering, and feature recognition. However, the development of algorithms that perform a significant amount of…
This paper presents a convex approach to the optimization of a cooperative rendezvous, that is, the problem of two distant spacecraft that simultaneously operate to get closer. Convex programming guarantees convergence towards the optimal…
This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…
We present a novel feasibility criteria for the finite intersection of convex sets given by inequalities. This criteria allows us to easily assert the feasibility by analyzing the unconstrained minimum of a speci?fic convex function, that…
Recent years have witnessed a tremendous growth using topological summaries, especially the persistence diagrams (encoding the so-called persistent homology) for analyzing complex shapes. Intuitively, persistent homology maps a potentially…
Optimization problems with set-valued objective functions arise in contexts such as multi-stage optimization with vector-valued objectives. The aim is to identify an optimizer -- a feasible point with an optimal objective value -- based on…
In the optimization of convex domains under a PDE constraint numerical difficulties arise in the approximation of convex domains in $\mathbb{R}^3$. Previous research used a restriction to rotationally symmetric domains to reduce shape…
Conventional approximations to Bayesian inference rely on either approximations by statistics such as mean and covariance or by point particles. Recent advances such as the ensemble Gaussian mixture filter have generalized these notions to…
Suppose we are given two metric spaces and a family of continuous transformations from one to the other. Given a probability distribution on each of these two spaces - namely the source and the target measures - the Wasserstein alignment…
In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…
Two distributed algorithms are described that enable all users connected over a network to cooperatively solve the problem of minimizing the sum of all users' objective functions over the intersection of all users' constraint sets, where…
Finding two disjoint simple paths on two given sets of points is a geometric problem introduced by Jeff Erickson. This problem has various applications in computational geometry, like robot motion planning, generating polygon etc. We will…
Given a set of disjoint simple polygons $\sigma_1, \ldots, \sigma_n$, of total complexity $N$, consider a convexification process that repeatedly replaces a polygon by its convex hull, and any two (by now convex) polygons that intersect by…
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…
Relaxation and rounding approaches became a standard and extremely versatile tool for constrained submodular function maximization. One of the most common rounding techniques in this context are contention resolution schemes. Such schemes…
Suppose that $A$ and $B$ are closed subsets of a Euclidean space such that $A\cap B\neq\varnothing$, and we aim to find a point in this intersection with the help of the sequences $(a_n)_\nnn$ and $(b_n)_\nnn$ generated by the \emph{method…
Given closed convex sets $C_i$, $i=1,\ldots,\ell$, and some nonzero linear maps $A_i$, $i = 1,\ldots,\ell$, of suitable dimensions, the multi-set split feasibility problem aims at finding a point in $\bigcap_{i=1}^\ell A_i^{-1}C_i$ based on…
Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.