I-SMOOTH: iteratively smoothing piecewise-constant Poisson-process rate functions

Authors:
Huifen Chen;Bruce Schmeiser
Affiliations:
Chung-Yuan University, Taoyuan, Taiwan;Purdue University, West Lafayette, IN
Venue:
Proceedings of the Winter Simulation Conference
Year:
2011

Citing 3
Cited 1

Nonparametric estimation of the Cumulative intensity function for a nonhomogeneous Poisson process

Management Science
Algorithm 559: The Stationary Point of a Quadratic Function Subject to Linear Constraints [E4]

ACM Transactions on Mathematical Software (TOMS)
Toeplitz and circulant matrices: a review

Communications and Information Theory

I-SMOOTH: Iteratively Smoothing Mean-Constrained and Nonnegative Piecewise-Constant Functions

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Piecewise-constant Poisson process rate functions are easy to estimate and provide easy random-process generation. When the true rate function is continuous, however, a piecewise-constant approximation is sometimes unacceptably crude. Given a non-negative piecewise-constant rate function, we discuss SMOOTH (Smoothing via Mean-constrained Optimized-Objective Time Halving), a quadratic optimization formulation that yields a smoother non-negative piecewise-constant rate function having twice as many time intervals, each of half the length. I-SMOOTH (Iterated SMOOTH) iterates the SMOOTH formulation to create a sequence of piecewise-constant rate functions having an asymptotic continuous rate function. We consider two contexts: finite-horizon and cyclic. We develop a sequence of computational simplifications for SMOOTH, moving from numerically minimizing the quadratic objective function, to numerically computing a matrix inverse, to a closed-form matrix inverse obtained as finite sums, to decision variables that are linear combinations of the given rates, and to simple approximations.