相关论文: Smoothed Analysis of Interior-Point Algorithms: Co…
In a previous article about the homogenization of the classical problem of diff usion in a bounded domain with su ciently smooth boundary we proved that the error is of order $\epsilon^{1/2}$. Now, for an open set with su ciently smooth…
We consider the stack $\mathcal{L}og_X$ parametrizing log schemes over a log scheme $X$, and weak and strong properties of log morphisms via $\mathcal{L}og_X$, as defined by Olsson. We give a concrete combinatorial presentation of…
Assume that $N$ is a sufficiently large positive number. In this paper we show that for a small constant $\varepsilon>0$, the logarithmic inequality \begin{equation*} \big|p_1\log p_1+p_2\log p_2+p_3\log p_3-N\big|<\varepsilon…
Constrained second-order convex optimization algorithms are the method of choice when a high accuracy solution to a problem is needed, due to their local quadratic convergence. These algorithms require the solution of a constrained…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
We improve the "sieve" part of the number field sieve used in factoring integer and computing discrete logarithm. The runtime of our method is shorter than that of existing methods. Under some reasonable assumptions, we prove that it is…
We provide an improvement of the H\"ormander multiplier theorem in which the Sobolev space $L^r_s(\mathbb R^n)$ with integrability index $r$ and smoothness index $s>n/r$ is replaced by the Sobolev space with smoothness $s$ built upon the…
We introduce the notion of a regular integrable connection on a smooth log scheme over $\mathbf{C}$ and construct an equivalence between the category of such connections and the category of integrable connections on its analytification,…
Recent advances in randomized incremental methods for minimizing $L$-smooth $\mu$-strongly convex finite sums have culminated in tight complexity of $\tilde{O}((n+\sqrt{n L/\mu})\log(1/\epsilon))$ and $O(n+\sqrt{nL/\epsilon})$, where…
In this paper, we study nonconvex constrained stochastic zeroth-order optimization problems, for which we have access to exact information of constraints and noisy function values of the objective. We propose a Bregman linearized augmented…
In this work we describe a minimal log-resolution of an ideal in a smooth complex surface from the minimal log-resolution of its generators.
In this paper consisting of two parts, we study the integral of a logarithmic differential form on a compact semi-algebraic set in R^n or C^n. In Part I, we prove the convergence of the integral when the semi-algebraic set satisfies…
We present an algorithm computing the determinant of an integer matrix A. The algorithm is introspective in the sense that it uses several distinct algorithms that run in a concurrent manner. During the course of the algorithm partial…
We give cohomological criteria for logarithmic good reduction of elliptic surfaces up to modification. Along the way, we prove several more general results about such surfaces in positive characteristic, as well as about log smooth…
In this article we give an algorithm for computing the integral closure of a reduced Noetherian ring R, in case this integral closure is finitely generated over R.
We show that the unrestricted black-box complexity of the $n$-dimensional XOR- and permutation-invariant LeadingOnes function class is $O(n \log (n) / \log \log n)$. This shows that the recent natural looking $O(n\log n)$ bound is not…
A recent work by Christiansen, Nowicki, and Rotenberg provides dynamic algorithms for coloring sparse graphs, concretely as a function of the arboricity alpha of the input graph. They give two randomized algorithms: O({alpha} log {alpha})…
This proposal relates to the design, analysis and application of a novel numerical scheme for the solution of axisymmetric scattering problems. To this end, a procedure is introduced to iteratively evaluate the solution of the…
We present an algorithm for strongly refuting smoothed instances of all Boolean CSPs. The smoothed model is a hybrid between worst and average-case input models, where the input is an arbitrary instance of the CSP with only the negation…
The geometric condition of T. Saito for trivial action of the wild monodromy of a smooth proper curve over the generic point of a trait is transformed to the condition of logarithmic smooth reduction. The proof emphasizes methods and…