A reassessment of the Snyman-Fatti dynamic search trajectory method for unconstrained global optimization
From MaRDI portal
Publication:1029666
DOI10.1007/s10898-008-9293-yzbMath1169.90459OpenAlexW2024295185MaRDI QIDQ1029666
Publication date: 13 July 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9293-y
Lennard-Jones clustersglobal optimization algorithmdynamic search trajectoriesrandom multi-start optimization
Related Items (4)
Global minimum cost design of a welded square stiffened plate supported at four corners ⋮ Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials ⋮ Dynamic search trajectory methods for global optimization ⋮ Steklov regularization and trajectory methods for univariate global optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Differential evolution. A practical approach to global optimization. With CD-ROM.
- The structure of atomic and molecular clusters, optimised using classical potentials
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- A multi-start global minimization algorithm with dynamic search trajectories
- A new and dynamic method for unconstrained minimization
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Evolutionary operators in global optimization with dynamic search trajectories
- An iterative global optimization algorithm for potential energy minimization
- A differential free point generation scheme in the differential evolution algorithm
- Minimum weight design of laminated composite plates subject to strength constraint
This page was built for publication: A reassessment of the Snyman-Fatti dynamic search trajectory method for unconstrained global optimization
