Simplicial Partitions in Global Optimization | SpringerLink Skip to main content
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your …

In this paper, black-box global optimization problem with expensive function evaluations is
considered. This problem is challenging for numerical methods due to the practical limits on …

Direct-type global optimization algorithms often spend an excessive number of function
evaluations on problems with many local optima exploring suboptimal local minima, thereby …

In this work, we introduce DIRECTGO, a new MATLAB toolbox for derivative-free global
optimization. DIRECTGO collects various deterministic derivative-free DIRECT-type …

In many important design problems, some decisions should be made by finding the global
optimum of a multiextremal objective function subject to a set of constrains. Frequently …

In many practical decision-making problems it happens that functions involved in
optimization process are black-box with unknown analytical representations and hard to …

Optimization for process design in the chemical engineering industry has been important for
energy efficiency and economic feasibility. Because many industries perform optimization …

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 …

Global optimization algorithms discussed in the previous chapter, use the global estimate of
the Lipschitz constant L given a priori and do not take into account the local information …

A global optimization problem is studied where the objective function f (x) is a
multidimensional black-box function and its gradient f′(x) satisfies the Lipschitz condition …