Convergence Rates of the POD-Greedy Method

Finally, in the last section we consider a quadratic cost with respect to the control, we study the relation with the gradient plus projection method and we prove that the rate

Abstract: We established the rate of convergence in the central limit theorem for stopped sums of a class of martingale difference sequences.. Sur la vitesse de convergence dans le

Proposition 5.1 of Section 5 (which is the main ingredient for proving Theorem 2.1), com- bined with a suitable martingale approximation, can also be used to derive upper bounds for

There has recently been a very important literature on methods to improve the rate of convergence and/or the bias of estimators of the long memory parameter, always under the

More specifically, studying the renewal in R (see [Car83] and the beginning of sec- tion 2), we see that the rate of convergence depends on a diophantine condition on the measure and

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

In this paper, we propose EdGe , an Edge-based Greedy sequence recommen- dation algorithm that extends the classical greedy algorithm proposed in [6], but instead of selecting at

Index Terms— optimal control, singular control, second or- der optimality condition, weak optimality, shooting algorithm, Gauss-Newton