IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v79y2021i2d10.1007_s10898-019-00814-w.html
   My bibliography  Save this article

Multistart with early termination of descents

Author

Listed:
  • Antanas Žilinskas

    (Vilnius University)

  • Jonathan Gillard

    (Cardiff University)

  • Megan Scammell

    (Cardiff University)

  • Anatoly Zhigljavsky

    (Cardiff University)

Abstract

Multistart is a celebrated global optimization technique frequently applied in practice. In its pure form, multistart has low efficiency. However, the simplicity of multistart and multitude of possibilities of its generalization make it very attractive especially in high-dimensional problems where e.g. Lipschitzian and Bayesian algorithms are not applicable. We propose a version of multistart where most of the local descents are terminated very early; we will call it METOD as an abbreviation for multistart with early termination of descents. The performance of the proposed algorithm is demonstrated on randomly generated test functions with 100 variables and a modest number of local minimizers.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jglopt:v:79:y:2021:i:2:d:10.1007_s10898-019-00814-w
    DOI: 10.1007/s10898-019-00814-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-019-00814-w
    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-019-00814-w?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. R. Haycroft & L. Pronzato & H. P. Wynn & A. Zhigljavsky, 2009. "Studying Convergence of Gradient Algorithms Via Optimal Experimental Design Theory," Springer Optimization and Its Applications, in: Luc Pronzato & Anatoly Zhigljavsky (ed.), Optimal Design and Related Areas in Optimization and Statistics, chapter 2, pages 13-37, Springer.
    2. Anatoly Zhigljavsky & Antanas Žilinskas, 2008. "Stochastic Global Optimization," Springer Optimization and Its Applications, Springer, number 978-0-387-74740-8, June.
    3. 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.
    4. James K. Hartman, 1973. "Some experiments in global optimization," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 20(3), pages 569-576, September.
    Full references (including those not matched with items on IDEAS)

    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. 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. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Luc Pronzato & Anatoly Zhigljavsky, 2011. "Gradient algorithms for quadratic optimization with fast convergence rates," Computational Optimization and Applications, Springer, vol. 50(3), pages 597-617, December.
    8. 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.
    9. 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.
    10. M. Gaviano & D. Lera & A. Steri, 2010. "A local search method for continuous global optimization," Journal of Global Optimization, Springer, vol. 48(1), pages 73-85, September.
    11. Ratko Grbić & Emmanuel Nyarko & Rudolf Scitovski, 2013. "A modification of the DIRECT method for Lipschitz global optimization for a symmetric function," Journal of Global Optimization, Springer, vol. 57(4), pages 1193-1212, December.
    12. Moody Chu & Matthew Lin & Liqi Wang, 2014. "A study of singular spectrum analysis with global optimization techniques," Journal of Global Optimization, Springer, vol. 60(3), pages 551-574, November.
    13. Victor Gergel & Evgeny Kozinov, 2018. "Efficient multicriterial optimization based on intensive reuse of search information," Journal of Global Optimization, Springer, vol. 71(1), pages 73-90, May.
    14. Ferreiro-Ferreiro, Ana M. & García-Rodríguez, José A. & Souto, Luis & Vázquez, Carlos, 2019. "Basin Hopping with synched multi L-BFGS local searches. Parallel implementation in multi-CPU and GPUs," Applied Mathematics and Computation, Elsevier, vol. 356(C), pages 282-298.
    15. Yaroslav D. Sergeyev & Marat S. Mukhametzhanov & Dmitri E. Kvasov & Daniela Lera, 2016. "Derivative-Free Local Tuning and Local Improvement Techniques Embedded in the Univariate Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 186-208, October.
    16. Remigijus Paulavičius & Yaroslav Sergeyev & Dmitri Kvasov & Julius Žilinskas, 2014. "Globally-biased Disimpl algorithm for expensive global optimization," Journal of Global Optimization, Springer, vol. 59(2), pages 545-567, July.
    17. James Calvin, 2010. "A lower bound on convergence rates of nonadaptive algorithms for univariate optimization with noise," Journal of Global Optimization, Springer, vol. 48(1), pages 17-27, September.
    18. Daniela Lera & Yaroslav Sergeyev, 2010. "An information global minimization algorithm using the local improvement technique," Journal of Global Optimization, Springer, vol. 48(1), pages 99-112, September.
    19. Daniela Lera & Yaroslav D. Sergeyev, 2018. "GOSH: derivative-free global optimization using multi-dimensional space-filling curves," Journal of Global Optimization, Springer, vol. 71(1), pages 193-211, May.
    20. Linas Stripinis & Remigijus Paulavičius, 2022. "Experimental Study of Excessive Local Refinement Reduction Techniques for Global Optimization DIRECT-Type Algorithms," Mathematics, MDPI, vol. 10(20), pages 1-18, October.

    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:79:y:2021:i:2:d:10.1007_s10898-019-00814-w. 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.