Related papers: Order-2 Delaunay Triangulations Optimize Angles
A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…
We analyze convergence of gradient-descent methods on Riemannian manifolds. In particular, we study randomization of Riemannian gradient algorithms for minimizing smooth cost functions (of Morse-Bott type). We prove that randomized gradient…
We introduce new global and local inexact oracle concepts for a wide class of convex functions in composite convex minimization. Such inexact oracles naturally come from primal-dual framework, barrier smoothing, inexact computations of…
In this paper, we generalize existing frameworks for $\mathcal{H}_2\otimes\mathcal{L}_2$-optimal model order reduction to a broad class of parametric linear time-invariant systems. To this end, we derive first-order necessary ptimality…
In this work, we develop new optimization algorithms that use approximate second-order information combined with the gradient regularization technique to achieve fast global convergence rates for both convex and non-convex objectives. The…
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalization of Schnyder woods to $d$-angulations (plane graphs with…
Two popular and often applied methods to obtain two-dimensional point sets with the optimal order of $L_p$ discrepancy are digit scrambling and symmetrization. In this paper we combine these two techniques and symmetrize $b$-adic Hammersley…
In our previous works, we proposed a physically-inspired rule to organize the data points into an in-tree (IT) structure, in which some undesired edges are allowed to occur. By removing those undesired or redundant edges, this IT structure…
We obtain a classification result for rotational surfaces in the Heisenberg space and the universal cover of the special linear group, whose mean curvature is given as a prescribed $C^1$ function depending on their angle function. We show…
In this paper, we have compared r.e. sets based on their enumeration orders with Turing machines. Accordingly, we have defined novel concept uniformity for Turing machines and r.e. sets and have studied some relationships between uniformity…
The frequency-weighted model order reduction techniques are used to find a lower-order approximation of the high-order system that exhibits high-fidelity within the frequency region emphasized by the frequency weights. In this paper, we…
This work introduces a locally refined version of the Adini finite element for the planar biharmonic equation on rectangular partitions with at most one hanging node per edge. If global continuity of the discrete functions is enforced, for…
This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have…
In this article, we prove a strong version of local Bertini theorem for normality on local rings in mixed characteristic. The main result asserts that a generic hyperplane section of a normal, Cohen-Macaulay, and complete local domain of…
Compared to conforming P1 finite elements, nonconforming P1 finite element discretizations are thought to be less sensitive to the appearance of distorted triangulations. E.g., optimal-order discrete $H^1$ norm best approximation error…
This paper considers the distributed nonconvex optimization problem of minimizing a global cost function formed by a sum of local cost functions by using local information exchange. We first consider a distributed first-order primal-dual…
In a cloud of m-dimensional data points, how would we spot, as well as rank, both single-point- as well as group- anomalies? We are the first to generalize anomaly detection in two dimensions: The first dimension is that we handle both…
In recent years, attempts to generalize lattice gauge theories to model topological order have been carried out through the so called $2$-gauge theories. These have opened the door to interesting new models and new topological phases which…
We show that Delaunay triangulations and compressed quadtrees are equivalent structures. More precisely, we give two algorithms: the first computes a compressed quadtree for a planar point set, given the Delaunay triangulation; the second…
In this paper, we present some second-order sufficient conditions in terms of the Demyanov-Pevnyi's second-order directional derivatives for efficiency of $C^1$ vector optimization problems with constraints. Our results improve and…