Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization
From MaRDI portal
Publication:6183089
Abstract: This article considers a box-constrained global optimization problem for Lipschitz-continuous functions with an unknown Lipschitz constant. Motivated by the famous DIRECT (DIviding RECTangles), a new HALRECT (HALving RECTangles) algorithm is introduced. A new deterministic approach combines halving (bisection) with a new multi-point sampling scheme in contrast to trisection and midpoint sampling used in the most existing DIRECT-type algorithms. A new partitioning and sampling scheme utilizes more comprehensive information about the objective function. Four different strategies of selecting potentially optimal hyper-rectangles are introduced to exploit the information about the objective function effectively. The original HALRECT algorithm and other introduced HALRECT variations (twelve in total) are tested and compared with the other twelve recently introduced DIRECT-type algorithms on box-constrained benchmark functions from DIRECTGOLib v1.1, and 96 perturbed their versions. The extensive experimental results show a very promising performance compared to state-of-the-art DIRECT-type global optimization. New HALRECT approaches offers high robustness across problems of different degrees of complexity, varying from simple - uni-modal and low dimensional to complex - multi-modal and higher dimensionality.
Recommendations
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- Simplicial Lipschitz optimization without the Lipschitz constant
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework
Cites work
- scientific article; zbMATH DE number 3691091 (Why is no real title available?)
- scientific article; zbMATH DE number 1301898 (Why is no real title available?)
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- A DIRECT-type approach for derivative-free constrained global optimization
- A Sequential Method Seeking the Global Maximum of a Function
- A locally-biased form of the DIRECT algorithm.
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
- Acceleration of univariate global optimization algorithms working with Lipschitz functions and Lipschitz first derivatives
- Additive scaling and the \texttt{DIRECT} algorithm
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
- Algorithm 829
- An algorithm for finding the absolute extremum of a function
- An approach to constrained global optimization based on exact penalty functions
- An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework
- Comparison of deterministic and stochastic approaches to global optimization
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Design and implementation of a massively parallel version of DIRECT
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Deterministic global optimization. An introduction to the diagonal approach
- Encyclopedia of optimization. In 6 vols.
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- Filter-based DIRECT method for constrained global optimization
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Globally-biased disimpl algorithm for expensive global optimization
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- Introduction to global optimization
- Introduction to global optimization exploiting space-filling curves
- Lipschitz and Hölder global optimization using space-filling curves
- Lipschitzian optimization without the Lipschitz constant
- Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives
- Numerical methods using two different approximations of space-filling curves for black-box global optimization
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization
- Pattern recognition and machine learning.
- Simplicial Lipschitz optimization without the Lipschitz constant
- The DIRECT algorithm: 25 years later
This page was built for publication: Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6183089)
