Dynamic data structures for a direct search algorithm

DOI10.1023/A:1019992822938MaRDI QIDQ1812081zbMATH OpenFDO

Authors Jian He, Layne T. Watson, Naren Ramakrishnan, Clifford A. Shaffer, Alex Verstak, Jing Jiang, Kyung Bae, William H. Tranter

Publication date 18 June 2003

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

zbMATH Keywords

global optimizationdirect searchdynamic data structuresDIRECT algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37)

Recommendations

• Global optimization using the DIRECT algorithm in Matlab
• The DIRECT algorithm: 25 years later
• A fully-distributed parallel global search algorithm
• Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
• MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems

Cited in

(27)

• DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization
• Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
• Globally-biased disimpl algorithm for expensive global optimization
• Design and implementation of a massively parallel version of DIRECT
• Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm
• An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework
• Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
• Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
• Global optimization using the DIRECT algorithm in Matlab
• Surface passivation optimization using DIRECT
• Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm
• A modified DIviding RECTangles algorithm for a problem in astrophysics
• scientific article; zbMATH DE number 1830754 (Why is no real title available?)
• The DIRECT algorithm: 25 years later
• Adaptive block coordinate DIRECT algorithm
• Lipschitz gradients for global optimization in a one-point-based partitioning scheme
• A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
• Improving the convergence rate of the DIRECT global optimization algorithm
• Deterministic parallel global parameter estimation for a model of the budding yeast cell cycle
• On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization
• Multiobjective optimization using an adaptive weighting scheme
• Additive scaling and the \texttt{DIRECT} algorithm
• Simplicial Lipschitz optimization without the Lipschitz constant
• A fully-distributed parallel global search algorithm
• A univariate global search working with a set of Lipschitz constants for the first derivative
• Escaping local minima with local derivative-free methods: a numerical investigation
• Parallel deterministic and stochastic global minimization of functions with very many minima

Describes a project that uses

Uses Software

• Global Optimization Toolbox For Maple
• HOMPACK90

This page was built for publication: Dynamic data structures for a direct search algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812081)