2007
DOI: 10.1002/jcc.20830
|View full text |Cite
|
Sign up to set email alerts
|

New Tabu Search based global optimization methods outline of algorithms and study of efficiency

Abstract: The study presents two new nonlinear global optimization routines; the Gradient Only Tabu Search (GOTS) and the Tabu Search with Powell's Algorithm (TSPA). They are based on the Tabu-Search strategy, which tries to determine the global minimum of a function by the steepest descent-mildest ascent strategy. The new algorithms are explained and their efficiency is compared with other approaches by determining the global minima of various well-known test functions with varying dimensionality. These tests show that… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
33
0

Year Published

2009
2009
2015
2015

Publication Types

Select...
7

Relationship

4
3

Authors

Journals

citations
Cited by 21 publications
(33 citation statements)
references
References 62 publications
0
33
0
Order By: Relevance
“…There exist other metaheuristic optimization algorithms which can also be employed for example the scatter search algorithm [30] or the tabu-searchbased algorithms. [31] We chose the simulated annealing approach due to its ability to quickly escape from local minima, which is very important considering the properties of the negative squared difference surface.…”
Section: Surface In the Refinement Processmentioning
confidence: 99%
“…There exist other metaheuristic optimization algorithms which can also be employed for example the scatter search algorithm [30] or the tabu-searchbased algorithms. [31] We chose the simulated annealing approach due to its ability to quickly escape from local minima, which is very important considering the properties of the negative squared difference surface.…”
Section: Surface In the Refinement Processmentioning
confidence: 99%
“…TS can handle non-differentiable objective functions, but the energy functions used in conformational sampling are typically continuous and differentiable, which allows to tailor the TS to such functions, for instance with the gradient tabu search [233] and variants [234]. So far, relatively few applications of TS to molecular conformational sampling questions have been presented, but TS has been tested for flexible ligand docking [235] and optimization of the conformational energy of the pentapeptide Met-enkephalin [236] (which has become a methodological test case [85,192,[237][238][239]).…”
Section: J Tabu Searchmentioning
confidence: 99%
“…[63][64][65][66][67] To adopt the TS to the continuous conformational search problem, we developed several TS-based approaches. 68,69 Within these approaches, the gradient only TS (GOTS) turned out to be most efficient. 69,70 For the minimization step that launches a descent to the next local minimum, GOTS uses a Quasi-Newton method, combined with a steepest descent approach.…”
Section: Introductionmentioning
confidence: 99%
“…68,69 Within these approaches, the gradient only TS (GOTS) turned out to be most efficient. 69,70 For the minimization step that launches a descent to the next local minimum, GOTS uses a Quasi-Newton method, combined with a steepest descent approach. [71][72][73][74] To escape local minima, the GOTS uses grids of function values.…”
Section: Introductionmentioning
confidence: 99%