Related papers: A numerical approach for the filtered generalized …
In topological data analysis (TDA), a longstanding challenge is to recognize underlying geometric structures in noisy data. One motivating examples is the shape of a point cloud in Euclidean space given by image. Carlsson et al. proposed a…
In this paper, we discuss an efficient algorithm for computing the growth distance between two compact convex sets with representable support functions. The growth distance between two sets is the minimum scaling factor such that the sets…
In this paper we study the generalized vertex cover problem (GVC), which is a generalization of various well studied combinatorial optimization problems. GVC is shown to be equivalent to the unconstrained binary quadratic programming…
We present in this paper two different classes of general $K$-splitting algorithms for solving finite-dimensional convex optimization problems. Under the assumption that the function being minimized has a Lipschitz continuous gradient, we…
Rips complexes are important structures for analyzing topological features of metric spaces. Unfortunately, generating these complexes constitutes an expensive task because of a combinatorial explosion in the complex size. For $n$ points in…
We present an exact general remeshing scheme to compute analytic integrals of polynomial functions over the intersections between convex polyhedral cells of old and new meshes. In physics applications this allows one to ensure global mass,…
In this paper, we consider a class of generalized difference-of-convex functions (DC) programming, whose objective is the difference of two convex (not necessarily smooth) functions plus a decomposable (possibly nonconvex) function with…
Distributed optimization utilizes local computation and communication to realize a global aim of optimizing the sum of local objective functions. This article addresses a class of constrained distributed nonconvex optimization problems…
A numerical method is formulated for the solution of the advective Cahn-Hilliard (CH) equation with constant and degenerate mobility in three-dimensional porous media with non-vanishing velocity on the exterior boundary. The CH equation…
We present an algorithm where only the Cholesky basis is determined in the decomposition procedure. This allows for improved screening and a partitioned matrix decomposition scheme, both of which significantly reduce memory usage and…
Cofaces -- simplices that contain a given simplex -- have multiple important uses in generating and using a Vietoris-Rips filtration: both in creating the coboundary matrix for computing persistent cohomology, and for generating the ordered…
We generalize the Lellouch-Luscher formula, relating weak matrix elements in finite and infinite volumes, to the case of multiple strongly-coupled decay channels into two scalar particles. This is a necessary first step on the way to a…
We study two related quantities which generalize the concept of upper Banach density of a set to two measurable subsets of the plane. The first of them allows us to generalize a classic result on sufficiently large distances realized in a…
We develop a framework for algorithms finding the diameter in graphs of bounded distance Vapnik-Chervonenkis dimension, in (parameterized) subquadratic time complexity. The class of bounded distance VC-dimension graphs is wide, including,…
A \v{C}ech complex of a finite simple graph $G$ is a nerve complex of balls in the graph, with one ball centered at each vertex. More precisely, let the \v{C}ech complex $\mathcal{N}(G,r)$ be the nerve of all closed balls of radius…
We consider the problem of covering the boundary of a simple polygon on n vertices using the minimum number of geodesic unit disks. We present an O(n \log^2 n+k) time 2-approximation algorithm for finding the centers of the disks, with k…
We extend a distributed finite element method built upon model order reduction to arbitrary polynomial degree using a hybrid Nitsche scheme. The new method considerably simplifies the transformation of the finite element system to the…
Given a convex polygon $P$ with $n$ vertices, the two-center problem is to find two congruent closed disks of minimum radius such that they completely cover $P$. We propose an algorithm for this problem in the streaming setup, where the…
We develop and analyze the Generalized Multiplicative Gradient (GMG) method for solving a class of convex optimization problems over symmetric cones, where the objective function does not have Lipschitz gradient over the feasible region.…
From dedicated QCD studies to new physics background estimation, jets will be everywhere at the LHC. In these proceedings, we discuss two important recent series of improvements. In the first one, we introduce new algorithms and new…