The Knowledge-Gradient Policy for Correlated Normal Beliefs

Published Online:https://doi.org/10.1287/ijoc.1080.0314

References

  • Bechhofer R. E., Santner T. J., Goldsman D. M.Design and Analysis of Experiments for Statistical Selection, Screening and Multiple Comparisons (1995) (John Wiley & Sons, New York) Google Scholar
  • Branin F. H. Widely convergent method for finding multiple solutions of simultaneous nonlinear equations. IBM J. Res. Develop (1972) 16(5):504–522CrossrefGoogle Scholar
  • Branke J., Chick S. E., Schmidt C. Selecting a selection procedure. Management Sci. (2007) 53(12):1916–1932LinkGoogle Scholar
  • Chen C. H., Dai L., Chen H. C. A gradient approach for smartly allocating computing budget for discrete event simulation. Winter Simul. Conf. Proc., Coronado, CA (1996) (IEEE Computer Society, Washington, DC) 398–405CrossrefGoogle Scholar
  • Chen C. H., He D., Fu M. Efficient dynamic simulation allocation in ordinal optimization. IEEE Trans. Automatic Control (2006) 51(12):2005–2009CrossrefGoogle Scholar
  • Chen C. H., Lin J., Yücesan E., Chick S. E. Simulation budget allocation for further enhancing the efficiency of ordinal optimization. Discrete Event Dynam. Sys. (2000) 10(3):251–270CrossrefGoogle Scholar
  • Chick S. E., Inoue K. New procedures to select the best simulated system using common random numbers. Management Sci. (2001a) 47(8):1133–1149LinkGoogle Scholar
  • Chick S. E., Inoue K. New two-stage and sequential procedures for selecting the best simulated system. Oper. Res. (2001b) 49(5):732–743LinkGoogle Scholar
  • Chick S. E., Branke J., Schmidt C. New myopic sequential sampling procedures. INFORMS J. Comput. (2007) . SubmittedGoogle Scholar
  • Cressie N. A. C.Statistics for Spatial Data (1993) 605revised ed.(Wiley Interscience, New York) CrossrefGoogle Scholar
  • Currin C., Mitchell T., Morris M., Ylvisaker D. Bayesian prediction of deterministic functions, with applications to the design and analysis of computer experiments. J. Amer. Statist. Assoc. (1991) 86(December):953–963CrossrefGoogle Scholar
  • Frazier P., Powell W. B., Mason S. J., Hill R. R., Mönch L., Rose O., Jefferson T., Fowler J. W. The knowledge-gradient stopping rule for ranking and selection. Proc. 2008 Winter Simul. Conf. (2008) Miami:305–312CrossrefGoogle Scholar
  • Frazier P., Powell W. B., Dayanik S. A knowledge gradient policy for sequential information collection. SIAM J. Control Optim. (2008) 47(5):2410–2439CrossrefGoogle Scholar
  • Fu M. C. Optimization for simulation: Theory vs. practice. INFORMS J. Comput. (2002) 14(3):192–215LinkGoogle Scholar
  • Fu M. C., Hu J.-Q., Chen C.-H., Xiong X. Simulation allocation for determining the best design in the presence of correlated sampling. INFORMS J. Comput. (2007) 19(1):101–111LinkGoogle Scholar
  • Gelman A. B., Carlin J. B., Stern H. S., Rubin D. B.Bayesian Data Analysis (2004) 2nd ed.(CRC Press, Boca Raton, FL) Google Scholar
  • Golub G. H., Van Loan C. F.Matrix Computations (1996) (John Hopkins University Press, Baltimore) Google Scholar
  • Gordon R. D. Values of Mills' ratio of area to bounding ordinate and of the normal probability integral for large values of the argument. Ann. Math. Statist. (1941) 12(3):364–366CrossrefGoogle Scholar
  • Gupta S. S., Miescke K. J. Bayesian look ahead one-stage sampling allocations for selection of the best population. J. Statist. Planning Inference (1996) 54(2):229–244CrossrefGoogle Scholar
  • Hartman J. K. Some experiments in global optimization. Naval Res. Logist. Quart. (1973) 20(3):569–576CrossrefGoogle Scholar
  • He D. H., Chick S. E., Chen C.-H. Opportunity cost and OCBA selection procedures in ordinal optimization for a fixed number of alternative systems. IEEE Trans. Sys., Man Cybernetics Part C (2007) 37(5):951–961CrossrefGoogle Scholar
  • Huang D., Allen T. T., Notz W. I., Zeng N. Global optimization of stochastic black-box systems via sequential Kriging meta-models. J. Global Optim. (2006) 34(3):441–466CrossrefGoogle Scholar
  • Inoue K., Chick S. E., Chen C. An empirical evaluation of several methods to select the best system. ACM Trans. Model. Comput. Simulation (1999) 9(4):381–407CrossrefGoogle Scholar
  • Jones D. R., Schonlau M., Welch W. J. Efficient global optimization of expensive black-box functions. J. Global Optim. (1998) 13(4):455–492CrossrefGoogle Scholar
  • Kennedy M. C., O'Hagan A. Bayesian calibration of computer models. J. Roy. Statist. Soc. Ser. B (2001) 63(3):425–464CrossrefGoogle Scholar
  • Kim S.-H., Nelson B. L. A fully sequential procedure for indifference-zone selection in simulation. ACM Trans. Model. Comput. Simulation (2001) 11(3):251–273CrossrefGoogle Scholar
  • Kleijnen J. P. C. Kriging metamodeling in simulation: A review. Eur. J. Oper. Res. (2009) 192(3):707–716CrossrefGoogle Scholar
  • Kushner H. J. A new method of locating the maximum of an arbitrary multipeak curve in the presence of noise. J. Basic Engrg. (1964) 86:97–106CrossrefGoogle Scholar
  • Law A. M., Kelton W. D.Simulation Modeling and Analysis (2000) 3rd ed.(McGraw-Hill, New York) Google Scholar
  • Mockus J. On Bayesian methods for seeking the extremum (in Russian). Automatics Comp. (1972) 53–62Google Scholar
  • Mockus J.Bayesian Approach to Global Optimization: Theory and Applications (1989) (Kluwer Academic, Dordrecht, The Netherlands) CrossrefGoogle Scholar
  • Mockus J. Application of Bayesian approach to numerical methods of global and stochastic optimization. J. Global Optim. (1994) 4(4):347–365CrossrefGoogle Scholar
  • Mockus J., Tiesis V., Zilinskas A., Dixon L. C. W., Szego G. P. The application of Bayesian methods for seeking the extremum. Towards Global Optimisation (1978) 2(North-Holland, Amsterdam) 117–129Google Scholar
  • Nelson B. L., Staum J. Control variates for screening, selection, and estimation of the best. ACM Trans. Model. Comput. Simulation (2006) 16(1):52–75CrossrefGoogle Scholar
  • Preparata F. P., Shamos M. I.Computational Geometry: An Introduction (1985) (Springer, New York) CrossrefGoogle Scholar
  • Raiffa H., Schlaifer R.Applied Statistical Decision Theory (1968) (MIT Press, Cambridge, MA) Google Scholar
  • Sacks J., Welch W. J., Mitchell T. J., Wynn H. P. Design and analysis of computer experiments. Statist. Sci. (1989) 4(4):409–423CrossrefGoogle Scholar
  • Sasena M. J. Flexibility and efficiency enhancements for constrained global design optimization with kriging approximations. (2002) . Ph.D thesis, University of Michigan, Ann ArborGoogle Scholar
  • Stuckman B. E. A global search method for optimizing nonlinear systems. IEEE Trans. Sys., Man Cybernetics (1988) 18(6):965–977CrossrefGoogle Scholar
  • Swisher J. R., Jacobson S. H., Yücesan E. Discrete-event simulation optimization using ranking, selection, and multiple comparison procedures: A survey. ACM Trans. Model. Comput. Simulation (2003) 13(2):134–154CrossrefGoogle Scholar
  • Williams B. J., Santner T. J., Notz W. I. Sequential design of computer experiments to minimize integrated response functions. Statistica Sinica (2000) 10:1133–1152Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.