Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
From MaRDI portal
Publication:2397824
DOI10.1007/s10589-015-9741-9zbMath1370.90194OpenAlexW2469826300MaRDI QIDQ2397824
Stefano Lucidi, Giampaolo Liuzzi, Veronica Piccialli
Publication date: 23 May 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9741-9
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items
Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm, A DIRECT-type approach for derivative-free constrained global optimization, On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization, Geodesic and contour optimization using conformal mapping, Escaping local minima with local derivative-free methods: a numerical investigation, Augmented Lagrangian method with alternating constraints for nonlinear optimization problems, Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization, Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization, A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement, Black-Box Optimization: Methods and Applications, Improving the convergence rate of the DIRECT global optimization algorithm, Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants, The DIRECT algorithm: 25 years later, Filter-based DIRECT method for constrained global optimization, Convergent inexact penalty decomposition methods for cardinality-constrained problems, A multi-objective \textbf{DIRECT} algorithm for ship hull optimization, A derivative-free optimization approach for the autotuning of a forex trading strategy, Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}, TESTGO, A derivative-free algorithm for constrained global optimization based on exact penalty functions
Uses Software
Cites Work
- Unnamed Item
- A modified DIRECT algorithm with bilevel partition
- Global optimization by multilevel partition
- A modified DIviding RECTangles algorithm for a problem in astrophysics
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Lipschitzian optimization without the Lipschitz constant
- Efficient algorithms for large scale global optimization: Lennard-Jones clusters
- A magnetic resonance device designed via global optimization techniques
- Dynamic data structures for a direct search algorithm
- A partition-based global optimization algorithm
- Simplicial Lipschitz optimization without the Lipschitz constant
- Globally-biased disimpl algorithm for expensive global optimization
- A derivative-free algorithm for constrained global optimization based on exact penalty functions
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- Deterministic parallel global parameter estimation for a model of the budding yeast cell cycle
- On the identification of the convex hull of a finite set of points in the plane
- Simplicial Global Optimization
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- On convergence of "divide the best" global optimization algorithms
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Global optimization on funneling landscapes
- A locally-biased form of the DIRECT algorithm.
- A derivative-free algorithm for bound constrained optimization
