The mean shift (MS) algorithm is a non-parametric, iterative technique that has been used to find modes of an estimated probability density function (pdf). Although the MS algorithm has been widely used in many applications, such as clustering, image segmentation, and object tracking, a rigorous...

We propose new over-identifying restriction (OIR) tests that are robust to heteroskedasticity and serial correlations of unknown form. The proposed tests do not require consistent estimation of the asymptotic covariance matrix and hence avoid choosing the bandwidth in nonparametric kernel...

In this paper, we propose interior-point algorithms for <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$P_* (\kappa )$$</EquationSource> </InlineEquation>-linear complementarity problem based on a new class of kernel functions. New search directions and proximity measures are defined based on these functions. We show that if a strictly feasible starting point is available,...</equationsource></inlineequation>

The problem of estimating an unknown density function has been widely studied. In this paper we present a convolution estimator for the density of the responses in a nonlinear regression model. The rate of convergence for the variance of the convolution estimator is of order 1/n. This is faster...

We extend the KVB approach of Kiefer, Vogelsang, and Bunzel (2000, Econometrica) and Kiefer and Vogelsang (2002b, Econometric Theory) to construct a class of robust tests for over-identifying restrictions in the context of GMM. The proposed test does not require consistent estimation of the...