Related papers: Dynamique du probl\`eme $3x+1$ sur la droite r\'ee…
We study a dynamic version of the implicit trace estimation problem. Given access to an oracle for computing matrix-vector multiplications with a dynamically changing matrix A, our goal is to maintain an accurate approximation to A's trace…
Higher dimensional space-time models provide us an alternative interpretation of nature, and give us different dynamical aspects than the traditional four-dimensional space-time models. Motivated by such recent interests, especially for…
This paper proposes a partially inexact alternating direction method of multipliers for computing approximate solution of a linearly constrained convex optimization problem. This method allows its first subproblem to be solved inexactly…
Most research in the theory of evolutionary computation assumes that the problem at hand has a fixed problem size. This assumption does not always apply to real-world optimization challenges, where the length of an optimal solution may be…
Inspired by its success for their continuous counterparts, the standard approach to deal with mixed-integer recourse (MIR) models under distributional uncertainty is to use distributionally robust optimization (DRO). We argue, however, that…
Drift analysis has become a powerful tool to prove bounds on the runtime of randomized search heuristics. It allows, for example, fairly simple proofs for the classical problem how the (1+1) Evolutionary Algorithm (EA) optimizes an…
We provide a unified strategy to show that solutions of dynamic programming principles associated to the $p$-Laplacian converge to the solution of the corresponding Dirichlet problem. Our approach includes all previously known cases for…
The study of discrete-time stochastic processes on the half-line with mean drift at $x$ given by $\mu_1 (x) \to 0$ as $x \to \infty$ is known as Lamperti's problem. We give sharp almost-sure bounds for processes of this type in the case…
The paper deals with the fast-slow motions setups in the discrete time $X^\epsilon((n+1)\epsilon)=X^\epsilon(n\epsilon)+\epsilon B(X^\epsilon(n\epsilon),\xi(n))$, $n=0,1,...,[T/\epsilon]$ and the continuous time $\frac…
We consider the perturbed Mann's iterative process \begin{equation} x_{n+1}=(1-\theta_n)x_n+\theta_n f(x_n)+r_n, \end{equation} where $f:[0,1]\rightarrow[0,1]$ is a continuous function, $\{\theta_n\}\in [0,1]$ is a given sequence, and…
The primal problem of multinomial likelihood maximization restricted to a convex closed subset of the probability simplex is studied. Contrary to widely held belief, a solution of this problem may assign a positive mass to an outcome with…
The dynamical sampling problem is centered around reconstructing signals that evolve over time according to a dynamical process, from spatial-temporal samples that may be noisy. This topic has been thoroughly explored for one-dimensional…
We demonstrate that the number of cycles for two problems of the family of generalized 3x+1 mappings is possible finite.
We describe convergence acceleration schemes for multistep optimization algorithms. The extrapolated solution is written as a nonlinear average of the iterates produced by the original optimization method. Our analysis does not need the…
We develop a dynamic version of the primal-dual method for optimization problems, and apply it to obtain the following results. (1) For the dynamic set-cover problem, we maintain an $O(f^2)$-approximately optimal solution in $O(f \cdot \log…
This paper introduces a Markov process inspired by the problem of quasicrystal growth. It acts over dimer tilings of the triangular grid by randomly performing local transformations, called {\em flips}, which do not increase the number of…
The asymptotic behavior (such as convergence to an equilibrium, convergence to a 2-cycle, and divergence to infinity) of solutions of the following multi-parameter, rational, second order difference equation x_{n+1} =(ax_{n}^3+…
We report on a new 3D numerical code designed to solve the Einstein equations for general vacuum spacetimes. This code is based on the standard 3+1 approach using cartesian coordinates. We discuss the numerical techniques used in developing…
We present an elementary derivation of the period-three cycles for the real quadratic map $x\mapsto x^2+c$, a fundamental model in one-dimensional discrete dynamics. Using symmetric polynomials, we obtain a complete algebraic…
We consider a range of simply stated dynamic data structure problems on strings. An update changes one symbol in the input and a query asks us to compute some function of the pattern of length $m$ and a substring of a longer text. We give…