File: README

package info (click to toggle)
nlopt 2.4.2%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 5,292 kB
  • ctags: 4,642
  • sloc: ansic: 22,387; cpp: 20,222; sh: 11,475; python: 323; makefile: 254; fortran: 108
file content (22 lines) | stat: -rw-r--r-- 947 bytes parent folder | download | duplicates (11)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
This is my implementation of the "Multi-Level Single-Linkage" (MLSL)
algorithm for global optimization by random local optimizations (a
multistart algorithm with "clustering" to avoid repeated detection of
the same local minimum), modified to optionally use a Sobol'
low-discrepancy sequence (LDS) instead of pseudorandom numbers.  See:

   A. H. G. Rinnooy Kan and G. T. Timmer, "Stochastic global optimization
   methods," Mathematical Programming, vol. 39, p. 27-78 (1987).
       [ actually 2 papers -- part I: clustering methods (p. 27), then 
                              part II: multilevel methods (p. 57) ]

and also:

   Sergei Kucherenko and Yury Sytsko, "Application of deterministic
   low-discrepancy sequences in global optimization," Computational
   Optimization and Applications, vol. 30, p. 297-318 (2005).

It is under the same MIT license as the rest of my code in NLopt (see
../COPYRIGHT).

Steven G. Johnson
September 2007