1981
DOI: 10.1287/moor.6.1.19
|View full text |Cite
|
Sign up to set email alerts
|

Minimization by Random Search Techniques

Abstract: We give two general convergence proofs for random search algorithms. We review the literature and show how our results extend those available for specific variants of the conceptual algorithm studied here. We then exploit the convergence results to examine convergence rates and to actually design implementable methods. Finally we report on some computational experience.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

2
744
0
9

Year Published

1997
1997
2017
2017

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 1,450 publications
(780 citation statements)
references
References 7 publications
2
744
0
9
Order By: Relevance
“…Essential hydrogen atoms, Kollman united atom type charges, and solvation parameters were added with the aid of AutoDock tools [16]. Affinity (grid) maps of 20 × 20 × 20-Å grid points and 0.375-Å spacing were generated using the Autogrid program [17]. AutoDock parameter set-and distance-dependent dielectric functions were used in the calculation of the van der Waals and the electrostatic terms, respectively.…”
Section: Docking Servermentioning
confidence: 99%
“…Essential hydrogen atoms, Kollman united atom type charges, and solvation parameters were added with the aid of AutoDock tools [16]. Affinity (grid) maps of 20 × 20 × 20-Å grid points and 0.375-Å spacing were generated using the Autogrid program [17]. AutoDock parameter set-and distance-dependent dielectric functions were used in the calculation of the van der Waals and the electrostatic terms, respectively.…”
Section: Docking Servermentioning
confidence: 99%
“…The convergence of the algorithm stated above was established in the seminal work of Solis and Wets (1981). The crux of their work lies in the introduction of a conceptual algorithm which includes among others the above-mentioned algorithm.…”
Section: An Overview Of Random Search Techniquesmentioning
confidence: 99%
“…Observe that the essential supremum is tantamount to sup ft : lðD t Þ 40g, where lðÁÞ denotes the Lebesgue measure. This type of representation is actually preferred by Solis and Wets (1981).…”
Section: Preliminaries and Notationmentioning
confidence: 99%
See 2 more Smart Citations