The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In this paper, we analyze the celebrated EM algorithm from
the point of view of proximal point algorithms. More precisely, we study a new type of generalization of the EM procedure introduced in [Chretien and Hero (1998)] and called Kullback-proximal algorithms. The proximal framework allows us to prove new
results concerning the cluster points. An essential contribution is a detailed analysis of the case where some cluster points lie on the boundary of the parameter space.
The present work is a mathematical analysis of two algorithms, namely
the Roothaan and the level-shifting algorithms, commonly used in
practice to solve the Hartree-Fock equations. The level-shifting
algorithm is proved to be well-posed and to converge provided the shift
parameter is large enough. On the contrary, cases when the Roothaan
algorithm is not well defined or fails in converging are
exhibited. These mathematical results are confronted to numerical
experiments performed by chemists.
We first generalize, in an abstract framework, results on the order of convergence of a semi-discretization in time by an implicit Euler scheme of a stochastic parabolic equation. In this part, all the coefficients are globally Lipchitz. The case when the nonlinearity is only locally Lipchitz is then treated. For the sake of simplicity, we restrict our attention to the Burgers equation. We are not able in this case to compute a pathwise order of the approximation, we introduce the weaker notion...
We first generalize, in an abstract framework, results on the order of convergence of a semi-discretization in time by an implicit Euler scheme of a stochastic parabolic equation. In this part, all the coefficients are globally Lipchitz. The case when the nonlinearity is only locally Lipchitz is then treated. For the sake of simplicity, we restrict our attention to the Burgers equation. We are not able in this case to compute a pathwise order of the approximation, we introduce the weaker notion...
We consider the problem of providing optimal uncertainty quantification (UQ) – and hence rigorous certification – for partially-observed functions. We present a UQ framework within which the observations may be small or large in number, and need not carry information about the probability distribution of the system in operation. The UQ objectives are posed as optimization problems, the solutions of which are optimal bounds on the quantities of interest; we consider two typical settings, namely parameter...
Currently displaying 1 –
7 of
7