ACM Transactions on Mathematical Software· 2026Q1
GENDIRECT: a GENeralized DIRECT-type algorithmic framework for derivative-free global optimization
- 3citations
- Q1SCImago
- 2026year
Short summary
GENDIRECT is a new generalized algorithmic framework that unifies DIRECT-type derivative-free global optimization algorithms, enabling the efficient generation of hundreds of thousands of known and novel algorithm combinations.
AI-generated from the title and abstract; the full text is not read.
Key points
- GENDIRECT unifies numerous DIRECT-type derivative-free global optimization algorithms into a single, generalized framework.
- The framework enables the creation of hundreds of thousands of algorithm combinations by assembling modular components.
- Specific algorithmic components (e.g., reduced Pareto selection, infinity norm) can significantly enhance performance on certain objective functions.
- Results facilitate the derivation of practical default configurations for various optimization budget scenarios.
AI-generated from the title and abstract; the full text is not read.
Abstract
The DIRECT algorithm (DIviding RECTangles) has been a cornerstone of derivative-free global optimization for three decades, inspiring numerous enhancements and adaptations. The recent DIRECTGO toolbox consolidated over fifty of these implementations, providing users with a diverse set of tools. In this paper, we introduce GENDIRECT , a generalized framework that unifies DIRECT -type algorithms under a single approach. GENDIRECT offers a flexible alternative to creating yet another similar algorithm, enabling efficient generation of both known and novel DIRECT -type optimization algorithms through the assembly of different algorithmic components. This approach surpasses the flexibility of both the DIRECTGO toolbox and individual algorithms. GENDIRECT allows the creation of hundreds of thousands of combinations, facilitating customization and incorporation of new components for further advancements. A preliminary experimental study highlights the potential of specific algorithmic components (such as reduced Pareto selection or infinity norm for candidate size calculation) to significantly enhance performance on certain objective functions, emphasizing the importance of tailoring algorithmic choices within the framework to suit specific problem characteristics. The obtained results also facilitate the derivation of practical default configurations for small-, medium-, and large-budget optimization scenarios.
The authors' abstract, as published at the source. ACM Transactions on Mathematical Software, 2026 · DOI ↗
The rest is in the Pofolia app
Takeaways and questions to the paper; new summaries every day for your field. Free.
Sign in on the web to openField: Numerical Analysis
Numerical AnalysisMathematics