Metraipolis › archive › dc_252b7ee45657

A practical DIRECT-type algorithm for medium-scale black-box global optimization — arXiv:2609.09796

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.09796
License (as archived)
CC0-1.0
Archived
2026-10-16T10:13:26.113Z
SHA-256 of the archived text
d6296f325c69d1126d9ed3d1694705a1bbc08353782c319420af4c266798c3cf
Stable URL of this page
https://metraipolis.com/documento/dc_252b7ee45657

How to cite

A practical DIRECT-type algorithm for medium-scale black-box global optimization — arXiv:2609.09796 — arXiv (en), https://arxiv.org/abs/2609.09796 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_252b7ee45657 (Metraipolis archive dc_252b7ee45657, sha256 d6296f325c69d1126d9ed3d1694705a1bbc08353782c319420af4c266798c3cf)
BibTeX
@misc{dc252b7ee45657,
  title = {A practical DIRECT-type algorithm for medium-scale black-box global optimization — arXiv:2609.09796},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.09796},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_252b7ee45657; sha256 d6296f325c69d1126d9ed3d1694705a1bbc08353782c319420af4c266798c3cf},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.09796. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The DIRECT algorithm is a deterministic global optimization method known for its versatility and balanced exploration-exploitation strategy. However, DIRECT-type algorithms are primarily effective for low-dimensional problems and often exhibit slow convergence as dimensionality increases, limiting their applicability to more complex optimization tasks. To address this limitation, this paper introduces X-DTC-GL, a novel DIRECT-type algorithm that incorporates dynamic partitioning and hybridization techniques. The dynamic partitioning approach adaptively refines the search space based on local one-dimensional surrogate models, enabling rapid subdivision of promising hyper-rectangles. The hybridization strategy selectively employs a hill-climbing method to exploit promising regions identified by the surrogate models. Extensive experiments on four diverse benchmark suites demonstrate that X-DTC-GL significantly outperforms existing DIRECT-type baselines, achieving improvements of ~12% in solvability and ~27% in solution quality. Performance-profile analyses indicate the fastest convergence on up to ~40% of instances, the best runtime performance on ~17% of problems, and competitive overall execution times. By improving performance within the partition-based framework, these advances strengthen the algorithm's competitiveness in state-of-the-art black-box optimization.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in math.NA).
Categorie arXiv: Machine Learning (cs.LG) ; Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.09796 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:46:35.720Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).