Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
From MaRDI portal
Publication:2397824
Recommendations
- A DIRECT-type approach for derivative-free constrained global optimization
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- The DIRECT algorithm: 25 years later
- Improving the convergence rate of the DIRECT global optimization algorithm
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
Cites work
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- A derivative-free algorithm for bound constrained optimization
- A derivative-free algorithm for constrained global optimization based on exact penalty functions
- A locally-biased form of the DIRECT algorithm.
- A magnetic resonance device designed via global optimization techniques
- A modified DIRECT algorithm with bilevel partition
- A modified DIviding RECTangles algorithm for a problem in astrophysics
- A partition-based global optimization algorithm
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Deterministic parallel global parameter estimation for a model of the budding yeast cell cycle
- Dynamic data structures for a direct search algorithm
- Efficient algorithms for large scale global optimization: Lennard-Jones clusters
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Global optimization by multilevel partition
- Global optimization on funneling landscapes
- Globally-biased disimpl algorithm for expensive global optimization
- Lipschitzian optimization without the Lipschitz constant
- On convergence of "divide the best" global optimization algorithms
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- On the identification of the convex hull of a finite set of points in the plane
- Simplicial Lipschitz optimization without the Lipschitz constant
- Simplicial global optimization
Cited in
(23)- A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement
- Escaping local minima with local derivative-free methods: a numerical investigation
- A DIRECT-type approach for derivative-free constrained global optimization
- Geodesic and contour optimization using conformal mapping
- A derivative-free algorithm for constrained global optimization based on exact penalty functions
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization
- Filter-based DIRECT method for constrained global optimization
- The DIRECT algorithm: 25 years later
- Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm
- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- A derivative-free optimization approach for the autotuning of a forex trading strategy
- Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization
- TESTGO
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- Augmented Lagrangian method with alternating constraints for nonlinear optimization problems
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization
- Black-Box Optimization: Methods and Applications
- GLODS: global and local optimization using direct search
- A multi-objective \textbf{DIRECT} algorithm for ship hull optimization
- Improving the convergence rate of the DIRECT global optimization algorithm
This page was built for publication: Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397824)
