Additive scaling and the \texttt{DIRECT} algorithm
From MaRDI portal
Publication:858583
DOI10.1007/s10898-006-9029-9zbMath1142.90488OpenAlexW2010642019MaRDI QIDQ858583
Carl. T. Kelley, Daniel Finkel
Publication date: 11 January 2007
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9029-9
Related Items (39)
A modified differential evolution based solution technique for economic dispatch problems ⋮ Asynchronous parallel hybrid optimization combining DIRECT and GSS ⋮ Linear scaling and the DIRECT algorithm ⋮ Derivative-free optimization: a review of algorithms and comparison of software implementations ⋮ On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set ⋮ Modified DIRECT Algorithm for Scaled Global Optimization Problems ⋮ A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function ⋮ Adaptive block coordinate DIRECT algorithm ⋮ One-dimensional center-based l 1-clustering method ⋮ Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization ⋮ An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework ⋮ Lipschitz gradients for global optimization in a one-point-based partitioning scheme ⋮ Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization ⋮ A partition-based global optimization algorithm ⋮ A modified DIRECT algorithm with bilevel partition ⋮ An efficient stochastic natural frequency analysis method for axially varying functionally graded material pipe conveying fluid ⋮ Global optimization by multilevel partition ⋮ A direct search algorithm for global optimization ⋮ Parameter estimation in ordinary differential equations modeling via particle swarm optimization ⋮ Application of reduced-set Pareto-Lipschitzian optimization to truss optimization ⋮ Improving the convergence rate of the DIRECT global optimization algorithm ⋮ Simplicial Lipschitz optimization without the Lipschitz constant ⋮ Globally-biased disimpl algorithm for expensive global optimization ⋮ 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 ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ The DIRECT algorithm: 25 years later ⋮ Filter-based DIRECT method for constrained global optimization ⋮ The adaptation of the \(k\)-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm. ⋮ A naive multi-scale search algorithm for global optimization problems ⋮ Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints ⋮ Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} ⋮ A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints ⋮ A univariate global search working with a set of Lipschitz constants for the first derivative ⋮ SMGO: a set membership approach to data-driven global optimization ⋮ Derivative-free optimization methods ⋮ Center-based l1–clustering method ⋮ MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
Uses Software
Cites Work
- Unnamed Item
- Lipschitzian optimization without the Lipschitz constant
- Dynamic data structures for a direct search algorithm
- Algorithms for noisy problems in gas transmission pipeline optimization
- Asynchronous Parallel Pattern Search for Nonlinear Optimization
- `` Direct Search Solution of Numerical and Statistical Problems
- Analysis of Generalized Pattern Searches
- An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- A Simplex Method for Function Minimization
- A locally-biased form of the DIRECT algorithm.
- Using DIRECT to solve an aircraft routing problem
This page was built for publication: Additive scaling and the \texttt{DIRECT} algorithm
