scispace - formally typeset
Search or ask a question

Showing papers by "L. Jeff Hong published in 2007"


Journal ArticleDOI
TL;DR: In this paper, the authors introduce procedures that are capable of selecting the best alternative in these situations and provide the desired statistical guarantees, but they assume that the set of alternatives is available at the beginning of the experiment and in many situations, the alternatives are revealed (generated) sequentially during the experiment.
Abstract: Statistical Ranking and Selection (R&S) is a collection of experiment design and analysis techniques for selecting the system with the largest or smallest mean performance from among a finite set of alternatives. R&S procedures have received considerable research attention in the stochastic simulation community, and they have been incorporated in commercial simulation software. All existing procedures assume that the set of alternatives is available at the beginning of the experiment. In many situations, however, the alternatives are revealed (generated) sequentially during the experiment. We introduce procedures that are capable of selecting the best alternative in these situations and provide the desired statistical guarantees.

52 citations


Journal ArticleDOI
TL;DR: The goal of this article is to provide a general framework for locally convergent random-search algorithms for stochastic optimization problems when the objective function is embedded in a Stochastic simulation and the decision variables are integer ordered.
Abstract: The goal of this article is to provide a general framework for locally convergent random-search algorithms for stochastic optimization problems when the objective function is embedded in a stochastic simulation and the decision variables are integer ordered. The framework guarantees desirable asymptotic properties, including almost-sure convergence and known rate of convergence, for any algorithms that conform to its mild conditions. Within this framework, algorithm designers can incorporate sophisticated search schemes and complicated statistical procedures to design new algorithms.

52 citations


Proceedings ArticleDOI
09 Dec 2007
TL;DR: Stochastic Trust Region Gradient-Free Method (STRONG) is proposed for simulation optimization with continuous decision variables to solve these two problems and has the potential of solving high-dimensional problems efficiently.
Abstract: Response Surface Methodology (RSM) is a metamodel- based optimization method. Its strategy is to explore small subregions of the parameter space in succession instead of attempting to explore the entire parameter space directly. This method has been widely used in simulation optimization. However, RSM has two significant shortcomings: Firstly, it is not automated. Human involvements are usually required in the search process. Secondly, RSM is heuristic without convergence guarantee. This paper proposes Stochastic Trust Region Gradient-Free Method (STRONG) for simulation optimization with continuous decision variables to solve these two problems. STRONG combines the traditional RSM framework with the trust region method for deterministic optimization to achieve convergence property and eliminate the requirement of human involvement. Combined with appropriate experimental designs and specifically efficient screening experiments, STRONG has the potential of solving high-dimensional problems efficiently.

23 citations


Proceedings ArticleDOI
09 Dec 2007
TL;DR: This paper reviews the use of Monte Carlo simulation in the field of financial engineering and introduces their recent development, including path generation, pricing American-style derivatives, evaluating Greeks and estimating value-at-risk.
Abstract: This paper reviews the use of Monte Carlo simulation in the field of financial engineering. It focuses on several interesting topics and introduces their recent development, including path generation, pricing American-style derivatives, evaluating Greeks and estimating value-at-risk. The paper is not intended to be a comprehensive survey of the research literature.

16 citations


Proceedings ArticleDOI
09 Dec 2007
TL;DR: A new estimator is proposed by employing kernel method and its consistency and asymptotic normality for i.i.d. data is shown and it works well for the test problems.
Abstract: Quantiles, also known as value-at-risk in financial applications, are important measures of random performance. Quantile sensitivities provide information on how changes in the input parameters affect the output quantiles. In this paper, we study the estimation of quantile sensitivities using simulation. We propose a new estimator by employing kernel method and show its consistency and asymptotic normality for i.i.d. data. Numerical results show that our estimator works well for the test problems.

4 citations