Related papers: Axiomatizing Maximal Progress and Discrete Time
Self-stabilization ensures that, after any transient fault, the system recovers in a finite time and eventually exhibits a correct behaviour. Speculation consists in guaranteeing that the system satisfies its requirements for any execution…
A class of linear parabolic equations is considered. We derive a framework for the a posteriori error analysis of time discretisations by Richardson extrapolation of arbitrary order combined with finite element discretisations in space. We…
In this paper, we study Hegselmann-Krause models with a time-variable time delay. Under appropriate assumptions, we show the exponential asymptotic consensus when the time delay satisfies a suitable smallness assumption. Our main strategies…
We describe a method for time-critical decision making involving sequential tasks and stochastic processes. The method employs several iterative refinement routines for solving different aspects of the decision making problem. This paper…
We establish a discrete operator--theoretic framework for the analysis of implicit Euler and Lie--Trotter splitting schemes for delay differential equations (DDEs). Both schemes are formulated in terms of discrete resolvent operators acting…
Decentralized optimization is a powerful paradigm that finds applications in engineering and learning design. This work studies decentralized composite optimization problems with non-smooth regularization terms. Most existing gradient-based…
We present a general technique for the analysis of first-order methods. The technique relies on the construction of a duality gap for an appropriate approximation of the objective function, where the function approximation improves as the…
In this paper we investigate a priori error estimates for the space-time Galerkin finite element discretization of a simplified semilinear gradient enhanced damage model. The model equations are of a special structure as the state equation…
This paper deals with the convergence time analysis of a class of fixed-time stable systems with the aim to provide a new non-conservative upper bound for its settling time. Our contribution is fourfold. First, we revisit the well-known…
We study the problem of computing the value function from a discretely-observed trajectory of a continuous-time diffusion process. We develop a new class of algorithms based on easily implementable numerical schemes that are compatible with…
We consider constrained bilinear optimal control of second-order linear evolution partial differential equations (PDEs) with a reaction term on the half line, where control arises as a time-dependent reaction coefficient and constraints are…
A sequence $x_1,\dots,x_n,\dots$ of discrete-valued observations is generated according to some unknown probabilistic law (measure) $\mu$. After observing each outcome, one is required to give conditional probabilities of the next…
A discretization of an optimal control problem of a stochastic parabolic equation driven by multiplicative noise is analyzed. The state equation is discretized by the continuous piecewise linear element method in space and by the backward…
We present a parallelized primal-dual algorithm for solving constrained convex optimization problems. The algorithm is "block-based," in that vectors of primal and dual variables are partitioned into blocks, each of which is updated only by…
In this article, we consider abstract linear conservative systems and their time-discrete counterparts. Our main result is a representation formula expressing solutions of the continuous model through the solution of the corresponding…
This paper reveals that a common and central role, played in many error bound (EB) conditions and a variety of gradient-type methods, is a residual measure operator. On one hand, by linking this operator with other optimality measures, we…
We study the problem of finding the index of the minimum value of a vector from noisy observations. This problem is relevant in population/policy comparison, discrete maximum likelihood, and model selection. We develop an asymptotically…
We provide a general method to analyze the asymptotic properties of a variety of estimators of continuous time diffusion processes when the data are not only discretely sampled in time but the time separating successive observations may…
Addressing the large inefficiencies generated by the Deferred Acceptance (DA) mechanism requires priority violations, but which ones are justifiable? The leading approach is to ask individuals if they consent to waive their priority…
This paper investigates the convex optimization problem with general convex inequality constraints. To cope with this problem, a discrete-time algorithm, called augmented primal-dual gradient algorithm (Aug-PDG), is studied and analyzed. It…