IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v88y2024i1d10.1007_s10898-023-01297-6.html
   My bibliography  Save this article

A new partition method for DIRECT-type algorithm based on minimax design

Author

Listed:
  • Kai Jia

    (National University of Defense Technology)

  • Xiaojun Duan

    (National University of Defense Technology)

  • Zhengming Wang

    (National University of Defense Technology)

  • Taihe Yi

    (National University of Defense Technology)

  • Liang Yan

    (National University of Defense Technology)

  • Xuan Chen

    (National University of Defense Technology)

Abstract

This article presents a new DIRECT-type SCABALL (scattering balls) algorithm with a new partition method for derivation-free optimization problems. It does not focus on dividing the region of interest into specific geometric shapes, but rather scatters several balls to cover it. In SCABALL, several potential optimal regions are selected at each iteration, and they are covered by smaller balls sequentially. In this way, the SCABALL ensures the everywhere dense convergence. The center points and radii of the scattered balls significantly influence the efficiency of SCABALL; therefore, the minimax designs are used in the initial and sequential stages to obtain better coverage. The SCABALL parameters, including the number of balls and their radii, were analyzed by numerical investigation. We provided the empirical choices for those parameters and found that the balls’ radii can be contracted to balance efficiency and global convergence. Numerical experiments show that the SCABALL algorithm is locally biased and robust.

Suggested Citation

  • Kai Jia & Xiaojun Duan & Zhengming Wang & Taihe Yi & Liang Yan & Xuan Chen, 2024. "A new partition method for DIRECT-type algorithm based on minimax design," Journal of Global Optimization, Springer, vol. 88(1), pages 171-197, January.
    • Handle: RePEc:spr:jglopt:v:88:y:2024:i:1:d:10.1007_s10898-023-01297-6
    DOI: 10.1007/s10898-023-01297-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-023-01297-6
    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-023-01297-6?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:1:d:10.1007_s10898-023-01297-6. 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.