Markov decision models (MDM) used in practical applications are most often less complex than the underlying ‘true’ MDM. The reduction of model complexity is performed for several reasons. However, it is obviously of interest to know what kind of model reduction is reasonable (in regard to...

A common problem in applied regression analysis is that covariate values may be missing for some observations but imputed values may be available. This situation generates a trade-off between bias and precision: the complete cases are often disarmingly few, but replacing the missing observations...

This paper compares forecast performance of the ALI method and the MESMs and seeks ways of improving the ALI method. Inflation and GDP growth form the forecast objects for comparison, using data from China, Indonesia and the Philippines. The ALI method is found to produce better forecasts than...

A common problem in applied regression analysis is that covariate values may be missing for some observations but imputed values may be available. This situation generates a trade-off between bias and precision: the complete cases are often disarmingly few, but replacing the missing observations...

Convex Nonparametric Least Squares (CNLSs) is a nonparametric regression method that does not require a priori specification of the functional form. The CNLS problem is solved by mathematical programming techniques; however, since the CNLS problem size grows quadratically as a function of the...

The combination of spatial smoothing and asymptotic analysis allows reduction of computationally expensive 3D fuel cell models to 2D without sacrificing leading-order physics. This paper investigates, demonstrates, and verifies the spatial smoothing and asymptotic reduction of a 3D...

In this work linear-quadratic optimal control problems for parabolic equations with mixed control-state constraints are considered. These problems arise when a Lavrentiev regularization is utilized for state constrained linear-quadratic optimal control problems. For the numerical solution a...

Dynamical low-rank approximation is a differential-equation-based approach to efficiently compute low-rank approximations to time-dependent large data matrices or to solutions of large matrix differential equations. We illustrate its use in the following application areas: as an updating...