IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v71y2018i1d10.1007_s10898-017-0535-8.html
   My bibliography  Save this article

Performance of global random search algorithms for large dimensions

Author

Listed:
  • Andrey Pepelyshev

    (Cardiff University
    St.Petersburg State University)

  • Anatoly Zhigljavsky

    (Cardiff University
    Lobachevsky Nizhny Novgorod State University)

  • Antanas Žilinskas

    (Vilnius University)

Abstract

We investigate the rate of convergence of general global random search (GRS) algorithms. We show that if the dimension of the feasible domain is large then it is impossible to give any guarantee that the global minimizer is found by a general GRS algorithm with reasonable accuracy. We then study precision of statistical estimates of the global minimum in the case of large dimensions. We show that these estimates also suffer the curse of dimensionality. Finally, we demonstrate that the use of quasi-random points in place of the random ones does not give any visible advantage in large dimensions.

Suggested Citation

  • Andrey Pepelyshev & Anatoly Zhigljavsky & Antanas Žilinskas, 2018. "Performance of global random search algorithms for large dimensions," Journal of Global Optimization, Springer, vol. 71(1), pages 57-71, May.
    • Handle: RePEc:spr:jglopt:v:71:y:2018:i:1:d:10.1007_s10898-017-0535-8
    DOI: 10.1007/s10898-017-0535-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-017-0535-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-017-0535-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Anatoly Zhigljavsky & Emily Hamilton, 2010. "Stopping rules in k-adaptive global random search algorithms," Journal of Global Optimization, Springer, vol. 48(1), pages 87-97, September.
    2. Anatoly Zhigljavsky & Antanas Žilinskas, 2008. "Stochastic Global Optimization," Springer Optimization and Its Applications, Springer, number 978-0-387-74740-8, June.
    3. Dette, Holger & Pepelyshev, Andrey & Zhigljavsky, Anatoly, 2016. "Optimal designs for regression models with autoregressive errors," Statistics & Probability Letters, Elsevier, vol. 116(C), pages 107-115.
    4. L. De Haan & L. Peng, 1998. "Comparison of tail index estimators," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 52(1), pages 60-70, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. C. J. Price & M. Reale & B. L. Robertson, 2021. "Oscars-ii: an algorithm for bound constrained global optimization," Journal of Global Optimization, Springer, vol. 79(1), pages 39-57, January.
    2. Antanas Žilinskas & Jonathan Gillard & Megan Scammell & Anatoly Zhigljavsky, 2021. "Multistart with early termination of descents," Journal of Global Optimization, Springer, vol. 79(2), pages 447-462, February.
    3. Qiang Yang & Litao Hua & Xudong Gao & Dongdong Xu & Zhenyu Lu & Sang-Woon Jeon & Jun Zhang, 2022. "Stochastic Cognitive Dominance Leading Particle Swarm Optimization for Multimodal Problems," Mathematics, MDPI, vol. 10(5), pages 1-34, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Igor Fedotenkov, 2020. "A Review of More than One Hundred Pareto-Tail Index Estimators," Statistica, Department of Statistics, University of Bologna, vol. 80(3), pages 245-299.
    2. Ivanilda Cabral & Frederico Caeiro & M. Ivette Gomes, 2022. "On the comparison of several classical estimators of the extreme value index," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 51(1), pages 179-196, January.
    3. Christian Schluter, 2021. "On Zipf’s law and the bias of Zipf regressions," Empirical Economics, Springer, vol. 61(2), pages 529-548, August.
    4. Ahmad Aboubacrène Ag & Deme El Hadji & Diop Aliou & Girard Stéphane, 2019. "Estimation of the tail-index in a conditional location-scale family of heavy-tailed distributions," Dependence Modeling, De Gruyter, vol. 7(1), pages 394-417, January.
    5. Igor Fedotenkov, 2013. "A bootstrap method to test for the existence of finite moments," Journal of Nonparametric Statistics, Taylor & Francis Journals, vol. 25(2), pages 315-322, June.
    6. Vasiliy V. Grigoriev & Petr N. Vabishchevich, 2021. "Bayesian Estimation of Adsorption and Desorption Parameters for Pore Scale Transport," Mathematics, MDPI, vol. 9(16), pages 1-16, August.
    7. Jonathan Gillard & Anatoly Zhigljavsky, 2013. "Optimization challenges in the structured low rank approximation problem," Journal of Global Optimization, Springer, vol. 57(3), pages 733-751, November.
    8. Giulio Bottazzi & Davide Pirino & Federico Tamagni, 2015. "Zipf law and the firm size distribution: a critical discussion of popular estimators," Journal of Evolutionary Economics, Springer, vol. 25(3), pages 585-610, July.
    9. Ghosh, Souvik & Resnick, Sidney, 2010. "A discussion on mean excess plots," Stochastic Processes and their Applications, Elsevier, vol. 120(8), pages 1492-1517, August.
    10. Dette, Holger & Schorning, Kirsten & Konstantinou, Maria, 2017. "Optimal designs for comparing regression models with correlated observations," Computational Statistics & Data Analysis, Elsevier, vol. 113(C), pages 273-286.
    11. Chao Huang & Jin-Guan Lin & Yan-Yan Ren, 2012. "Statistical Inferences for Generalized Pareto Distribution Based on Interior Penalty Function Algorithm and Bootstrap Methods and Applications in Analyzing Stock Data," Computational Economics, Springer;Society for Computational Economics, vol. 39(2), pages 173-193, February.
    12. Jan Beran & Dieter Schell & Milan Stehlík, 2014. "The harmonic moment tail index estimator: asymptotic distribution and robustness," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 66(1), pages 193-220, February.
    13. Wagner, Niklas & Marsh, Terry A., 2005. "Measuring tail thickness under GARCH and an application to extreme exchange rate changes," Journal of Empirical Finance, Elsevier, vol. 12(1), pages 165-185, January.
    14. Fang, Wen & Wang, Jun, 2013. "Fluctuation behaviors of financial time series by a stochastic Ising system on a Sierpinski carpet lattice," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(18), pages 4055-4063.
    15. P. Lai & Stephen Lee, 2013. "Estimation of central shapes of error distributions in linear regression problems," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 65(1), pages 105-124, February.
    16. Nazih-Eddine Belkacem & Lakhdar Chiter & Mohammed Louaked, 2024. "A Novel Approach to Enhance DIRECT -Type Algorithms for Hyper-Rectangle Identification," Mathematics, MDPI, vol. 12(2), pages 1-24, January.
    17. Geluk, J. L. & Peng, Liang, 2000. "An adaptive optimal estimate of the tail index for MA(l) time series," Statistics & Probability Letters, Elsevier, vol. 46(3), pages 217-227, February.
    18. Vygantas Paulauskas & Marijus Vaičiulis, 2017. "A class of new tail index estimators," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 69(2), pages 461-487, April.
    19. Remigijus Paulavičius & Lakhdar Chiter & Julius Žilinskas, 2018. "Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants," Journal of Global Optimization, Springer, vol. 71(1), pages 5-20, May.
    20. C. J. Price & M. Reale & B. L. Robertson, 2021. "Oscars-ii: an algorithm for bound constrained global optimization," Journal of Global Optimization, Springer, vol. 79(1), pages 39-57, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:71:y:2018:i:1:d:10.1007_s10898-017-0535-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.