相关论文: Improved Examples of Non-Termination for Ruppert's…

We provide a spectrum of new theoretical insights and practical results for finding a Minimum Dilation Triangulation (MDT), a natural geometric optimization problem of considerable previous attention: Given a set $P$ of $n$ points in the…

This paper treats the problem of minimizing a general continuously differentiable function subject to sparsity constraints. We present and analyze several different optimality criteria which are based on the notions of stationarity and…

This paper investigates two issues on identification of switched linear systems: persistence of excitation and numerical algorithms. The main contribution is a much weaker condition on the regressor to be persistently exciting that…

Second-order estimates are established for solutions to the $p$-Laplace system with right-hand side in $L^2$. The nonlinear expression of the gradient under the divergence operator is shown to belong to $W^{1,2}$, and hence to enjoy the…

In 2015, Dankelmann and Bau proved that for every bridgeless graph $G$ of order $n$ and minimum degree $\delta$ there is an orientation of diameter at most $11\frac{n}{\delta+1}+9$. In 2016, Surmacs reduced this bound to…

In this work, we revisit nonlinear generalized minimal residual method (NGMRES) applied to nonlinear problems. NGMRES is used to accelerate the convergence of fixed-point iterations, which can substantially improve the performance of the…

We obtain worst case performance guarantees for $p=2$ and $3$ QAOA for MAXCUT on uniform 3-regular graphs. Previous work by Farhi et al obtained a lower bound on the approximation ratio of $0.692$ for $p=1$. We find a lower bound of…

We give an $n^{2+o(1)}$-time algorithm for finding $s$-$t$ min-cuts for all pairs of vertices $s$ and $t$ in a simple, undirected graph on $n$ vertices. We do so by constructing a Gomory-Hu tree (or cut equivalent tree) in the same running…

The order parameter of a critical system defined in a layered parallel plate geometry subject to Neumann boundary conditions at the limiting surfaces is studied. We utilize a one-particle irreducible vertex parts framework in order to study…

In this paper, we give infinitely many examples of (non-isomorphic) connected $k$-regular graphs with smallest eigenvalue in half open interval $[-1-\sqrt2, -2)$ and also infinitely many examples of (non-isomorphic) connected $k$-regular…

The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…

Finding surface mappings with least distortion arises from many applications in various fields. Extremal Teichm\"uller maps are surface mappings with least conformality distortion. The existence and uniqueness of the extremal…

We propose a computer-assisted approach to the analysis of the worst-case convergence of nonlinear conjugate gradient methods (NCGMs). Those methods are known for their generally good empirical performances for large-scale optimization,…

We provide new tradeoffs between approximation and running time for the decremental all-pairs shortest paths (APSP) problem. For undirected graphs with $m$ edges and $n$ nodes undergoing edge deletions, we provide four new approximate…

We prove two results: 1. A graph $G$ on at least seven vertices with a vertex $v$ such that $G-v$ is planar and $t$ triangles satisfies $|E(G)| \leq 3|V(G)|- 9 + t/3$. 2. For $p=2,3,\ldots,9$, a triangle-free graph $G$ on at least $2p-5$…

The goal of this note is to establish non-tangential convergence results for Schr\"{o}dinger operators along restricted curves. We consider the relationship between the dimension of this kind of approach region and the regularity for the…

In this paper, the proximal point algorithm for quasi-convex minimization problem in nonpositive curvature metric spaces is studied. We prove $\Delta$-convergence of the generated sequence to a critical point (which is defined in the text)…

For the right-angled Artin group action on the extension graph, it is known that the minimal asymptotic translation length is bounded above by 2 provided that the defining graph has diameter at least 3. In this paper, we show that the same…

We investigate the zero-forcing number for triangle-free graphs. We improve upon the trivial bound, $\delta \le Z(G)$ where $\delta$ is the minimum degree, in the triangle-free case. In particular, we show that $2 \delta - 2 \le Z(G)$ for…

The Carleman linearization is one of the mainstream approaches to lift a finite-dimensional nonlinear dynamical system into an infinite-dimensional linear system with the promise of providing accurate approximations of the original…