Dynamic data structures for a direct search algorithm
From MaRDI portal
Publication:1812081
DOI10.1023/A:1019992822938zbMath1036.90055MaRDI QIDQ1812081
William H. Tranter, Clifford A. Shaffer, Alex Verstak, Jian He, Jing Jiang, Layne T. Watson, Kyung Bae, Naren Ramakrishnan
Publication date: 18 June 2003
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37)
Related Items (19)
Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm ⋮ A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems ⋮ Additive scaling and the \texttt{DIRECT} algorithm ⋮ Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization ⋮ On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ Escaping local minima with local derivative-free methods: a numerical investigation ⋮ Surface passivation optimization using DIRECT ⋮ Lipschitz gradients for global optimization in a one-point-based partitioning scheme ⋮ A modified DIviding RECTangles algorithm for a problem in astrophysics ⋮ Parallel deterministic and stochastic global minimization of functions with very many minima ⋮ Design and implementation of a massively parallel version of DIRECT ⋮ 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 ⋮ Deterministic parallel global parameter estimation for a model of the budding yeast cell cycle ⋮ Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm ⋮ Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints ⋮ Multiobjective optimization using an adaptive weighting scheme ⋮ A univariate global search working with a set of Lipschitz constants for the first derivative
Uses Software
This page was built for publication: Dynamic data structures for a direct search algorithm