Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization
DOI10.1007/s10898-023-01296-7arXiv2205.03015OpenAlexW4381281764MaRDI QIDQ6183089
Remigijus Paulavičius, Linas Stripinis
Publication date: 26 January 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.03015
global optimizationLipschitz optimizationderivative-free optimizationsampling-based algorithm\texttt{DIRECT}-type algorithm
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Optimization problems in solid mechanics (74P99) Optimization problems in optics and electromagnetic theory (78M50) Mathematical programming (90C99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approach to constrained global optimization based on exact penalty functions
- Filter-based DIRECT method for constrained global optimization
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Additive scaling and the \texttt{DIRECT} algorithm
- Design and implementation of a massively parallel version of DIRECT
- Lipschitz and Hölder global optimization using space-filling curves
- Lipschitzian optimization without the Lipschitz constant
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- Introduction to global optimization
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- The DIRECT algorithm: 25 years later
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
- Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives
- Simplicial Lipschitz optimization without the Lipschitz constant
- Globally-biased disimpl algorithm for expensive global optimization
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- A DIRECT-type approach for derivative-free constrained global optimization
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization
- Introduction to Global Optimization Exploiting Space-Filling Curves
- Comparison of deterministic and stochastic approaches to global optimization
- An algorithm for finding the absolute extremum of a function
- Deterministic Global Optimization
- Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
- Algorithm 829
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A Sequential Method Seeking the Global Maximum of a Function
- A locally-biased form of the DIRECT algorithm.
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
- Numerical methods using two different approximations of space-filling curves for black-box global optimization
- An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework
This page was built for publication: Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization
