A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems

From MaRDI portal
Revision as of 18:35, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2379688

DOI10.1007/S10589-008-9217-2zbMath1187.90275OpenAlexW2140547575MaRDI QIDQ2379688

Giampaolo Liuzzi, Stefano Lucidi, Veronica Piccialli

Publication date: 19 March 2010

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-008-9217-2




Related Items (36)

Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithmLinear scaling and the DIRECT algorithmA DIRECT-type approach for derivative-free constrained global optimizationExploiting derivative-free local searches in DIRECT-type algorithms for global optimizationOn \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelizationGeodesic and contour optimization using conformal mappingModified DIRECT Algorithm for Scaled Global Optimization ProblemsA modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric functionLocal search based heuristics for global optimization: atomic clusters and beyondA robust optimization approach for magnetic spacecraft attitude stabilizationMultistart global optimization with tunnelling and an evolutionary strategy supervised by a martingaleLipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimizationA new partition method for DIRECT-type algorithm based on minimax designAn empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} frameworkA genetic algorithm for a global optimization problem arising in the detection of gravitational wavesA modified DIviding RECTangles algorithm for a problem in astrophysicsA modified DIRECT algorithm with bilevel partitionA filling function method for unconstrained global optimizationApplication of reduced-set Pareto-Lipschitzian optimization to truss optimizationImproving the convergence rate of the DIRECT global optimization algorithmSimplicial Lipschitz optimization without the Lipschitz constantGlobally-biased disimpl algorithm for expensive global optimizationGlobal optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constantsGOSH: derivative-free global optimization using multi-dimensional space-filling curvesAn approach to constrained global optimization based on exact penalty functionsThe DIRECT algorithm: 25 years laterA multi-objective \textbf{DIRECT} algorithm for ship hull optimizationAdvantages of simplicial partitioning for Lipschitz optimization problems with linear constraintsLFM signal parameters estimation using optimization approach initialized by Lipschitz constant assisted DIRECT algorithmImproved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraintsGlobal optimization of expensive black box functions using potential Lipschitz constants and response surfacesGlobal optimization based on local searchesGlobal optimization based on local searchesGlobal optimization of protein-peptide docking by a filling function methodMrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems


Uses Software



Cites Work




This page was built for publication: A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems