Help
Cart
Skip main navigation

Available Issues

August 2, 2017 - June 18, 2026

Available Issues

August 2, 2017 - June 18, 2026

Convergence Rates of Epsilon-Greedy Global Optimization Under Radial Basis Function Interpolation

Published Online:2 Aug 2022https://doi.org/10.1287/stsy.2022.0096

References

  • Abramson MA, Audet C (2006) Convergence of mesh adaptive direct search to second-order stationary points. SIAM J. Optim. 17(2):606–619.Google Scholar
  • Audet C, Dennis JE (2006) Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1):188–217.Google Scholar
  • Audet C, Béchard V, Le Digabel S (2008) Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search. J. Global Optim. 41(2):299–318.Google Scholar
  • Audet C, Savard G, Zghal W (2010) A mesh adaptive direct search algorithm for multiobjective optimization. Eur. J. Oper. Res. 204(3):545–556.Google Scholar
  • Back T (1996) Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms (Oxford University Press, Oxford, UK).Google Scholar
  • Bauschke HH, Hare WL, Moursi WM (2015) A derivative-free comirror algorithm for convex optimization. Optim. Methods Software 30(4):706–726.Google Scholar
  • Berahas AS, Byrd RH, Nocedal J (2019) Derivative-free optimization of noisy functions via quasi-newton methods. SIAM J. Optim. 29(2):965–993.Google Scholar
  • Björkman M, Holmström K (2000) Global optimization of costly nonconvex functions using radial basis functions. Optim. Engrg. 1(4):373–397.Google Scholar
  • Buhmann MD (2003) Radial Basis Functions (Cambridge University Press, Cambridge, UK).Google Scholar
  • Bull AD (2011) Convergence rates of efficient global optimization algorithms. J. Machine Learn. Res. 12:2879–2904.Google Scholar
  • Calvin J, Gimbutienė G, Phillips WO, Zilinskas A (2018) On convergence rate of a rectangular partition based global optimization algorithm. J. Global Optim. 71(1):165–191.Google Scholar
  • Conn AR, Gould NIM, Toint PL (2000) Trust Region Methods (SIAM, Philadelphia).Google Scholar
  • Conn AR, Scheinberg K, Toint PL (1997) On the convergence of derivative-free methods for unconstrained optimization. Buhmann MD, Iserles A, eds. Approximation Theory and Optimization: Tributes to M.J.D. Powell (Cambridge University Press, Cambridge, UK), 83–108. Google Scholar
  • Conn AR, Scheinberg K, Vicente LN (2009a) Global convergence of general derivative-free trust-region algorithms to first-and second-order critical points. SIAM J. Optim. 20(1):387–415.Google Scholar
  • Conn AR, Scheinberg K, Vicente LN (2009b) Introduction to Derivative-Free Optimization (SIAM, Philadelphia).Google Scholar
  • Corana A, Marchesi M, Martini C, Ridella S (1987) Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm. ACM Trans. Math. Software 13(3):262–280.Google Scholar
  • Duchi JC, Jordan MI, Wainwright MJ, Wibisono A (2015) Optimal rates for zero-order convex optimization: The power of two function evaluations. IEEE Trans. Inform. Theory 61(5):2788–2806.Google Scholar
  • Eitrich T, Lang B (2006) Efficient optimization of support vector machine learning parameters for unbalanced datasets. J. Comput. Appl. Math. 196(2):425–436.Google Scholar
  • Giuliani CM, Camponogara E (2015) Derivative-free methods applied to daily production optimization of gas-lifted oil fields. Comput. Chem. Engrg. 75:60–64.Google Scholar
  • Gutmann HM (2001) A radial basis function method for global optimization. J. Global Optim. 19(3):201–227.Google Scholar
  • Holmström K (2008) An adaptive radial basis function algorithm (ARBF) for expensive black-box global optimization. J. Global Optim. 41(3):447–464.Google Scholar
  • Hu X, Shi Y, Eberhart R (2004) Recent advances in particle swarm. Proc. 2004 Congress Evolutionary Comput., vol. 1, (IEEE, Piscataway, NJ), 90–97.Google Scholar
  • Huang D, Allen TT, Notz WI, Miller RA (2006) Sequential kriging optimization using multiple-fidelity evaluations. Structural Multidisciplinary Optim. 32(5):369–382.Google Scholar
  • Janson S (1987) Maximal spacings in several dimensions. Ann. Probability 15(1):274–280.Google Scholar
  • Jones DR, Schonlau M, Welch WJ (1998) Efficient global optimization of expensive black-box functions. J. Global Optim. 13(4):455–492.Google Scholar
  • Kamishima T, Akaho S (2011) Personalized pricing recommender system: Multi-stage epsilon-greedy approach. Cantador I, Brusilovsky P, Kuflik T, eds. Proc. 2nd Internat. Workshop Inform. Heterogeneity Fusion Recommender Systems (ACM, New York), 57–64.Google Scholar
  • Kolda TG, Lewis RM, Torczon V (2003) Optimization by direct search: New perspectives on some classical and modern methods. SIAM Rev. 45(3):385–482.Google Scholar
  • Lewis RM, Torczon V (1999) Pattern search algorithms for bound constrained minimization. SIAM J. Optim. 9(4):1082–1099.Google Scholar
  • Lewis RM, Torczon V (2000) Pattern search methods for linearly constrained minimization. SIAM J. Optim. 10(3):917–941.Google Scholar
  • Orosz JE, Jacobson SH (2002) Finite-time performance analysis of static simulated annealing algorithms. Comput. Optim. Appl. 21(1):21–53.Google Scholar
  • Powell MJD (1994) A direct search optimization method that models the objective and constraint functions by linear interpolation. Advances in Optimization and Numerical Analysis (Springer, Berlin), 51–67.Google Scholar
  • Powell MJD (2002) UOBYQA: Unconstrained optimization by quadratic approximation. Math. Programming 92(3):555–582.Google Scholar
  • Raykar V, Agrawal P (2014) Sequential crowdsourced labeling as an epsilon-greedy exploration in a Markov decision process. Kaski S, Corander J, eds. Proc. 17th Internat. Conf. Artificial Intelligence and Statist., 832–840.Google Scholar
  • Regis RG, Shoemaker CA (2005) Constrained global optimization of expensive black box functions using radial basis functions. J. Global Optim. 31(1):153–171.Google Scholar
  • Regis RG, Shoemaker CA (2007) Improved strategies for radial basis function methods for global optimization. J. Global Optim. 37(1):113–135.Google Scholar
  • Regis RG, Shoemaker CA (2009) Parallel stochastic global optimization using radial basis functions. INFORMS J. Comput. 21(3):411–426.Link, Google Scholar
  • Regis RG, Shoemaker CA (2013) Combining radial basis function surrogates and dynamic coordinate search in high-dimensional expensive black-box optimization. Engrg. Optim. 45(5):529–555.Google Scholar
  • Sasena MJ, Papalambros P, Goovaerts P (2002) Exploration of metamodeling sampling criteria for constrained global optimization. Engrg. Optim. 34(3):263–278.Google Scholar
  • Schutte JF, Groenwold AA (2005) A study of global optimization using particle swarms. J. Global Optim. 31(1):93–108.Google Scholar
  • Shashaani S, Hashemi FS, Pasupathy R (2018) ASTRO-DF: A class of adaptive sampling trust-region algorithms for derivative-free stochastic optimization. SIAM J. Optim. 28(4):3145–3176.Google Scholar
  • Shi ZJ, Guo J (2008) A new trust region method with adaptive radius. Comput. Optim. Appl. 41(2):225–242.Google Scholar
  • Srinivas N, Krause A, Kakade SM, Seeger M (2010) Gaussian process optimization in the bandit setting: No regret and experimental design. Fürnkranz J, Joachims T, eds. Proc. 27th Internat. Conf. Machine Learn. (Omnipress, Madison, WI), 1015–1022.Google Scholar
  • Sutton RS, Barto AG (2018) Reinforcement Learning: An Introduction, 2nd ed. (MIT Press, Cambridge, MA).Google Scholar
  • Teckentrup AL (2020) Convergence of Gaussian process regression with estimated hyper-parameters and applications in Bayesian inverse problems. SIAM/ASA J. Uncertainty Quantification 8(4):1310–1337.Google Scholar
  • Temme NM (1993) Asymptotic estimates of Stirling numbers. Stud. Appl. Math. 89(3):233–243.Google Scholar
  • Tikhomirov AS (2006) On the Markov homogeneous optimization method. Comput. Math. Math. Phys. 46(3):361–375.Google Scholar
  • Torczon V (1997) On the convergence of pattern search algorithms. SIAM J. Optim. 7(1):1–25.Google Scholar
  • Vakili S, Picheny V, Durrande N (2020) Regret bounds for noise-free Bayesian optimization. Preprint, submitted February 12, https://arxiv.org/abs/2002.05096.Google Scholar
  • Van den Bergh F, Engelbrecht AP (2006) A study of particle swarm optimization particle trajectories. Inform. Sci. 176(8):937–971.Google Scholar
  • Vaz AIF, Vicente LN (2007) A particle swarm pattern search method for bound constrained global optimization. J. Global Optim. 39(2):197–219.Google Scholar
  • Vazquez E, Bect J (2010) Pointwise consistency of the kriging predictor with known mean and covariance functions. Advances in Model-Oriented Design and Analysis (Springer, Berlin), 221–228.Google Scholar
  • Wild SM, Shoemaker C (2011) Global convergence of radial basis function trust region derivative-free algorithms. SIAM J. Optim. 21(3):761–781.Google Scholar
  • Wild SM, Regis RG, Shoemaker CA (2008) ORBIT: Optimization by radial basis function interpolation in trust-regions. SIAM J. Sci. Comput. 30(6):3197–3219.Google Scholar
  • Wu ZM, Schaback R (1993) Local error estimates for radial basis function interpolation of scattered data. IMA J. Numerical Anal. 13(1):13–27.Google Scholar
  • Yang XS (2010) Firefly algorithm, Levy flights and global optimization. Bramer M, Ellis R, Petridis M, eds., Research and Development in Intelligent Systems, vol. 26 (Springer, London), 209–218.Google Scholar
  • Zhigljavsky A, Zilinskas A (2008) Stochastic Global Optimization (Springer, Berlin).Google Scholar
Previous
Back to Top
Next
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.
Agree