IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v88y2024i3d10.1007_s10898-022-01185-5.html
   My bibliography  Save this article

An empirical study of various candidate selection and partitioning techniques in the DIRECT framework

Author

Listed:
  • Linas Stripinis

    (Vilnius University, Institute of Data Science and Digital Technologies)

  • Remigijus Paulavičius

    (Vilnius University, Institute of Data Science and Digital Technologies)

Abstract

Over the last three decades, many attempts have been made to improve the DIRECT (DIviding RECTangles) algorithm’s efficiency. Various novel ideas and extensions have been suggested. The main two steps of DIRECT-type algorithms are selecting and partitioning potentially optimal rectangles. However, the most efficient combination of these two steps is an area that has not been investigated so far. This paper presents a study covering an extensive examination of various candidate selection and partitioning techniques within the same DIRECT algorithmic framework. Twelve DIRECT-type algorithmic variations are compared on 800 randomly generated GKLS-type test problems and 96 box-constrained global optimization problems from DIRECTGOLib v1.1 with varying complexity. Based on these studies, we have identified the most efficient selection and partitioning combinations leading to new, more efficient, DIRECT-type algorithms. All these algorithms are included in the latest version of DIRECTGO v1.1.0 and are publicly available.

Suggested Citation

  • Linas Stripinis & Remigijus Paulavičius, 2024. "An empirical study of various candidate selection and partitioning techniques in the DIRECT framework," Journal of Global Optimization, Springer, vol. 88(3), pages 723-753, March.
    • Handle: RePEc:spr:jglopt:v:88:y:2024:i:3:d:10.1007_s10898-022-01185-5
    DOI: 10.1007/s10898-022-01185-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-022-01185-5
    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-022-01185-5?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.

    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:88:y:2024:i:3:d:10.1007_s10898-022-01185-5. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.