The presence of black-box functions in engineering design, which are usually computation-intensive, demands efficient global optimization methods. This article proposes a new global optimization method for black-box functions. The global optimization method is based on a novel mode-pursuing sampling method that systematically generates more sample points in the neighborhood of the function mode while statistically covering the entire search space. Quadratic regression is performed to detect the region containing the global optimum. The sampling and detection process iterates until the global optimum is obtained. Through intensive testing, this method is found to be effective, efficient, robust, and applicable to both continuous and discontinuous functions. It supports simultaneous computation and applies to both unconstrained and constrained optimization problems. Because it does not call any existing global optimization tool, it can be used as a standalone global optimization method for inexpensive problems as well. Limitations of the method are also identified and discussed.
An explicit formula for the probability that a Brownian motion crosses a piecewise linear boundary in a finite time interval is derived. This formula is used to obtain approximations to the crossing probabilities for general boundaries which are the uniform limits of piecewise linear functions. The rules for assessing the accuracies of the approximations are given. The calculations of the crossing probabilities are easily carried out through Monte Carlo methods. Some numerical examples are provided.
23 January 2007 in Methodology and Computing in Applied Probability
This paper is concerned with general nonlinear regression models where the predictor variables are subject to Berkson-type measurement errors. The measurement errors are assumed to have a general parametric distribution, which is not necessarily normal. In addition, the distribution of the random error in the regression equation is nonparametric. A minimum distance estimator is proposed, which is based on the first two conditional moments of the response variable given the observed predictor variables. To overcome the possible computational difficulty of minimizing an objective function which involves multiple integrals, a simulation-based estimator is constructed. Consistency and asymptotic normality for both estimators are derived under fairly general regularity conditions.
Wang and Pötzelberger (1997) derived an explicit formula for the probability that a Brownian motion crosses a one-sided piecewise linear boundary and used this formula to approximate the boundary crossing probability for general nonlinear boundaries. The present paper gives a sharper asymptotic upper bound of the approximation error for the formula, and generalizes the results to two-sided boundaries. Numerical computations are easily carried out using the Monte Carlo simulation method. A rule is proposed for choosing optimal nodes for the approximating piecewise linear boundaries, so that the corresponding approximation errors of boundary crossing probabilities converge to zero at a rate ofO(1/n2).
7 July 2007 in Annals of the Institute of Statistical Mathematics