summaryrefslogtreecommitdiffstats
path: root/scilab_doc/neldermead/neldermead.bib
blob: ca7d39a920a8912e750a4a14f9e0838f4c6971f8 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
@article{lagarias:112,
author = {Jeffrey C. Lagarias and James A. Reeds and Margaret H. Wright and Paul E. Wright},
collaboration = {},
title = {Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions},
publisher = {SIAM},
year = {1998},
journal = {SIAM Journal on Optimization},
volume = {9},
number = {1},
pages = {112-147},
keywords = {direct search methods; Nelder--Mead simplex methods; nonderivative optimization},
doi = {10.1137/S1052623496303470}
}



@article{citeulike:3009487,
   abstract = {A method is described for the minimization of a function of n variables, which depends on the comparison of function values at the (n + 1) vertices of a general simplex, followed by the replacement of the vertex with the highest value by another point. The simplex adapts itself to the local landscape, and contracts on to the final minimum. The method is shown to be effective and computationally compact. A procedure is given for the estimation of the Hessian matrix in the neighbourhood of the minimum, needed in statistical estimation problems. 10.1093/comjnl/7.4.308},
   author = {Nelder, J. A.  and Mead, R. },
   citeulike-article-id = {3009487},
   journal = {The Computer Journal},
   month = {January},
   number = {4},
   pages = {308--313},
   posted-at = {2008-09-15 16:23:09},
   priority = {2},
   title = {A Simplex Method for Function Minimization},
   volume = {7},
   year = {1965}
}

@Book{ nla.cat-vn1060620,
author = { Nash, J. C. },
title = { Compact numerical methods for computers : linear algebra and function minimisation},
isbn = { 0852743300 },
publisher = { Hilger, Bristol},
pages = { ix, 227 p. : },
year = { 1979 },
type = { Book },
subjects = { Numerical analysis -- Data processing },
}

@Book{Kelley1999,
title={Iterative Methods for Optimization},
author = {C. T. Kelley},
publisher = {SIAM Frontiers in Applied Mathematics},
volume={19},
year={1999},
}

@Book{KelleyMethodsOptimizationMatlabCodes,
title={Iterative Methods for Optimization: Matlab Codes},
author = {C. T. Kelley},
publisher = {North Carolina State University},
}
 
    @article{Spendley1962,
     jstor_articletype = {primary_article},
     title = {Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation},
     author = {Spendley, W. and Hext, G. R. and Himsworth, F. R.},
     journal = {Technometrics},
     jstor_issuetitle = {},
     volume = {4},
     number = {4},
     jstor_formatteddate = {Nov., 1962},
     pages = {441--461},
     ISSN = {00401706},
     abstract = {A technique for empirical optimisation is presented in which a sequence of experimental designs each in the form of a regular or irregular simplex is used, each simplex having all vertices but one in common with the preceding simplex, and being completed by one new point. Reasons for the choice of design are outlined, and a formal procedure given. The performance of the technique in the presence and absence of error is studied and it is shown (a) that in the presence of error the rate of advance is inversely proportional to the error standard deviation, so that replication of observations is not beneficial, and (b) that the "efficiency" of the technique appears to increase in direct proportion to the number of factors investigated. It is also noted that, since the direction of movement from each simplex is dependent solely on the ranking of the observations, the technique may be used even in circumstances when a response cannot be quantitatively assessed. Attention is drawn to the ease with which second-order designs having the minimum number of experimental points may be derived from a regular simplex, and a fitting procedure which avoids a direct matrix inversion is suggested. In a brief appendix one or two new rotatable designs derivable from a simplex are noted.},
     publisher = {American Statistical Association and American Society for Quality},
     language = {},
     copyright = {Copyright 1962 American Statistical Association and American Society for Quality},
     year = {1962},
    }
@book{NumericalRecipes,
author = {W. H. Press and Saul A. Teukolsky and William T. Vetterling and Brian P. Flannery},
title = {Numerical Recipes in C, Second Edition},
year = {1992},
publisher= {}}

@article{589283,
 author = {Kelley,, C. T.},
 title = {Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition},
 journal = {SIAM J. on Optimization},
 volume = {10},
 number = {1},
 year = {1999},
 issn = {1052-6234},
 pages = {43--55},
 doi = {http://dx.doi.org/10.1137/S1052623497315203},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
 }

@ARTICLE{O'Neill1971AAF,
       AUTHOR = "O'Neill, R.",
       TITLE = "Algorithm {AS47} - {F}unction minimization using a simplex procedure",
       JOURNAL = "Applied Statistics",
       VOLUME = "20",
       number = {3},
       YEAR = "1971",
       PAGES = "338--346",
} 
@ARTICLE{O'NeillAS47,
       AUTHOR = {O'Neill, R.},
       TITLE = {Algorithm AS47 - Fortran 77 source code},
       YEAR = {1971},
       note = {\url{http://lib.stat.cmu.edu/apstat/47}}
} 

@article{1285769,
 author = {Lee,, Donghoon and Wiswall,, Matthew},
 title = {A Parallel Implementation of the Simplex Function Minimization Routine},
 journal = {Comput. Econ.},
 volume = {30},
 number = {2},
 year = {2007},
 issn = {0927-7099},
 pages = {171--187},
 doi = {http://dx.doi.org/10.1007/s10614-007-9094-2},
 publisher = {Kluwer Academic Publishers},
 address = {Hingham, MA, USA},
 }

@article{LolimotColletteURL,
 author = {Collette, Yann},
 title = {Lolimot},
 note = {\url{http://sourceforge.net/projects/lolimot/}},
 }

@article{NelderMeadColletteURL,
 author = {Collette, Yann},
 title = {Lolimot - optim\_nelder\_mead.sci},
 note = {\url{http://lolimot.cvs.sourceforge.net/viewvc/lolimot/scilab/optim/macros/optim_nelder_mead.sci?revision=1.1.1.1&view=markup}},
 }


@article{MatlabFminsearch,
 author = {The Mathworks},
 title = {Matlab ? fminsearch},
 note = {\url{http://www.mathworks.com/access/helpdesk/help/techdoc/index.html?/access/helpdesk/help/techdoc/ref/fminsearch.html}},
 }

@article{GAMS-A19A20-Desc,
 author = {Nash, J.C.},
 title = {GAMS - A19A20 - Description},
 year = {1980},
 month = {February},
 note = {\url{http://gams.nist.gov/serve.cgi/Module/NASHLIB/A19A20/11238/}},
 }
@article{GAMS-A19A20-Source,
 author = {Nash, J.C. },
 title = {GAMS - A19A20 - Source Code},
 year = {1980},
 month = {February},
 note = {\url{http://gams.nist.gov/serve.cgi/ModuleComponent/11238/Source/ITL/A19A20}},
 }

@article{Burkardtasa047,
 author = {O'Neill, R. and Burkardt, John},
 title = {GAMS - A19A20 - Source Code},
 year = {2008},
 note = {\url{http://people.sc.fsu.edu/~burkardt/f77_src/asa047/asa047.f}},
 }


@article{BurkardtNelderMeadMatlab,
 author = {Jeff Borggaard},
 title = {nelder\_mead},
 year = {2009},
 month = {January},
 note = {\url{http://people.sc.fsu.edu/~burkardt/m_src/nelder_mead/nelder_mead.m}},
 }

@article{SurvivalBookOptim,
 title = {optim1.f},
 note = {\url{http://www.stat.uconn.edu/~mhchen/survbook/example51/optim1.f}},
 }

@Article{Guin:1968:DCM,
  author =       {J. A. Guin},
  title =        {Discussion and correspondence: modification of the complex method of constrained optimization},
  journal =      {The Computer Journal},
  volume =       {10},
  number =       {4},
  pages =        {416--417},
  month =        feb,
  year =         {1968},
  CODEN =        {CMPJA6},
  ISSN =         {0010-4620},
  bibdate =      {Fri Sep 29 08:51:24 MDT 2000},
  bibsource =    {http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_04/},
  acknowledgement = ack-nhfb,
}

@article{372783,
 author = {Shere,, Kenneth D.},
 title = {Remark on algorithm 454 : The complex method for constrained optimization},
 journal = {Commun. ACM},
 volume = {17},
 number = {8},
 year = {1974},
 issn = {0001-0782},
 pages = {471},
 doi = {http://doi.acm.org/10.1145/361082.372783},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@article{362324,
 author = {Richardson,, Joel A. and Kuester,, J. L.},
 title = {Algorithm 454: the complex method for constrained optimization},
 journal = {Commun. ACM},
 volume = {16},
 number = {8},
 year = {1973},
 issn = {0001-0782},
 pages = {487--489},
 doi = {http://doi.acm.org/10.1145/355609.362324},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@misc{NAGE04CCF,
 author = {NAG},
 title = {NAG Fortran Library Routine Document : E04CCF/E04CCA},
 note={\url{http://www.nag.co.uk/numeric/Fl/manual/xhtml/E04/e04ccf.xml}}
}

@TECHREPORT{Andersson01multiobjectiveoptimization,
    author = {Johan Andersson and Link\"opings Universitet},
    title = {Multiobjective Optimization in Engineering Design: Application to Fluid Power Systems},
    institution = {Department of Mechanical Engineering, Link\"oping University},
    year = {2001},
  note={\url{https://polopoly.liu.se/content/1/c6/10/99/74/phdthesis.pdf}}
}

@article{Box1965,
   author = {Box, M. J.},
   journal = {The Computer Journal},
   pages = {42--52},
   volume = {8},
   number = {1},
   title = {A New Method of Constrained Optimization and a Comparison With Other Methods},
   year = {1965 }
}

@article{69970,
 author = {Subrahmanyam,, M. B.},
 title = {An extension of the simplex method to constrained nonlinear optimization},
 journal = {J. Optim. Theory Appl.},
 volume = {62},
 number = {2},
 year = {1989},
 issn = {0022-3239},
 pages = {311--319},
 doi = {http://dx.doi.org/10.1007/BF00941060},
 publisher = {Plenum Press},
 address = {New York, NY, USA},
 }

@article{584536,
 author = {Nazareth,, Larry and Tseng,, Paul},
 title = {Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search},
 journal = {Comput. Optim. Appl.},
 volume = {22},
 number = {1},
 year = {2002},
 issn = {0926-6003},
 pages = {133--144},
 doi = {http://dx.doi.org/10.1023/A:1014842520519},
 publisher = {Kluwer Academic Publishers},
 address = {Norwell, MA, USA},
 }

@MISC{Perry01anew,
    author = {Ronald N. Perry and Ronald N. Perry},
    title = {A New Method For Numerical Constrained Optimization},
    year = {2001}
}

@article{HanNeumann2006,
 author = {Han, Lixing and Neumann, Michael},
 title = {Effect of dimensionality on the Nelder-Mead simplex method },
 journal = {Optimization Methods and Software},
 volume = {21},
 number = {1},
 year = {2006},
 pages = {1--16},
 }

@article{0266-5611-23-1-023,
  author={W J Barker and P A Conway},
  title={Convergent simplex searches and the \‘gloveless DataGlove\’},
  journal={Inverse Problems},
  volume={23},
  number={1},
  pages={405-419},
  url={http://stacks.iop.org/0266-5611/23/405},
  year={2007},
  abstract={The inversion of data from an electric field sensing array that can track the position and orientation of a hand modelled initially as a rigid bar is investigated as motions in the digits are introduced into the hand model. The inversion is shown to fail with increased dimensionality of the problem due to a pathology in the Nelder-Mead optimization algorithm used. Robust simplex search variants are tested on the problem and shown to successfully address this pathology resulting in a significant increase in the dimensionality for which the problem can be solved.}
}

@article{parkinson1972,
author = {Parkinson and Hutchinson},
title = {An investigation into the efficiency of variants on the simplex method},
publisher = {Academic Press},
year = {1972},
journal = {F. A. Lootsma, editor, Numerical Methods for Non-linear Optimization},
pages = {115-135},
}




@book{Han2000,
author = {Han, Lixing},
title = {Algorithms in Unconstrained Optimization},
year = {2000},
publisher= {Ph.D., The University of Connecticut}}

@TECHREPORT{Torczon89multi-directionalsearch,
    author = {Virginia Joanne Torczon},
    title = {Multi-Directional Search: A Direct Search Algorithm for Parallel Machines},
    institution = {Rice University},
    year = {1989}
}


@article{hanNeumann2003,
author = {Han, Lixing and Neumann, Michael and Xu, Jianhong},
title = {On the roots of certain polynomials arising from the analysis of the Nelder-Mead simplex method},
publisher = {Academic Press},
year = {2003},
journal = {Linear Algebra and its Applications},
pages = {109-124},
volume={363}
}

@article{590075,
 author = {Peters,, D. and Bolte,, H. and Marschner,, C. and N\"{u}ssen,, O. and Laur,, R.},
 title = {Enhanced Optimization Algorithms for the Development of Microsystems},
 journal = {Analog Integr. Circuits Signal Process.},
 volume = {32},
 number = {1},
 year = {2002},
 issn = {0925-1030},
 pages = {47--54},
 doi = {http://dx.doi.org/10.1023/A:1016071624422},
 publisher = {Kluwer Academic Publishers},
 address = {Hingham, MA, USA},
 }
@article{citeulike:1903787,
	abstract = {The greatest or least value of a function of several variables is to be found when the variables are restricted to a given region. A method is developed for dealing with this problem and is compared with possible alternatives. The method can be used on a digital computer, and is incorporated in a program for Mercury. 10.1093/comjnl/3.3.175},
	author = {Rosenbrock, H. H. },
	citeulike-article-id = {1903787},
	doi = {10.1093/comjnl/3.3.175},
	journal = {The Computer Journal},
	keywords = {deterministic, kisao, simulation\_algorithms},
	month = {March},
	number = {3},
	pages = {175--184},
	posted-at = {2007-11-12 19:07:20},
	priority = {2},
	title = {An Automatic Method for Finding the Greatest or Least Value of a Function},
	url = {http://dx.doi.org/10.1093/comjnl/3.3.175},
	volume = {3},
	year = {1960}
}



 

@article{Powell08011962,
author = {Powell, M. J. D.},
title = {{An Iterative Method for Finding Stationary Values of a Function of Several Variables}},
journal = {The Computer Journal},
volume = {5},
number = {2},
pages = {147-151},
doi = {10.1093/comjnl/5.2.147},
year = {1962},
abstract = {An iterative method for finding stationary values of a function of several variables is described. In many ways it is similar to the method of steepest descents; however this new method has second order convergence.
},
URL = {http://comjnl.oxfordjournals.org/cgi/content/abstract/5/2/147},
eprint = {http://comjnl.oxfordjournals.org/cgi/reprint/5/2/147.pdf}
}



 

@article{R.Fletcher08011963,
author = {Fletcher, R. and Powell, M. J. D.},
title = {{A Rapidly Convergent Descent Method for Minimization}},
journal = {The Computer Journal},
volume = {6},
number = {2},
pages = {163-168},
doi = {10.1093/comjnl/6.2.163},
year = {1963},
abstract = {A powerful iterative descent method for finding a local minimum of a function of several variables is described. A number of theorems are proved to show that it always converges and that it converges rapidly. Numerical tests on a variety of functions confirm these theorems. The method has been used to solve a system of one hundred non-linear simultaneous equations.
},
URL = {http://comjnl.oxfordjournals.org/cgi/content/abstract/6/2/163},
eprint = {http://comjnl.oxfordjournals.org/cgi/reprint/6/2/163.pdf}
}


@article{589109,
 author = {McKinnon,, K. I. M.},
 title = {Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point},
 journal = {SIAM J. on Optimization},
 volume = {9},
 number = {1},
 year = {1998},
 issn = {1052-6234},
 pages = {148--158},
 doi = {http://dx.doi.org/10.1137/S1052623496303482},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
 }



@article{355943,
 author = {Mor\'{e},, J. J. and Garbow,, Burton S. and Hillstrom,, Kenneth E.},
 title = {Algorithm 566: FORTRAN Subroutines for Testing Unconstrained Optimization Software [C5], [E4]},
 journal = {ACM Trans. Math. Softw.},
 volume = {7},
 number = {1},
 year = {1981},
 issn = {0098-3500},
 pages = {136--140},
 doi = {http://doi.acm.org/10.1145/355934.355943},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@TECHREPORT{Fan2002,
    author = {Ellen Fan},
    title = {Global Optimization Of Lennard-Jones Atomic Clusters},
    institution = {McMaster University},
    year = {2002},
    month = {February},
    day={26}
}

@ARTICLE{Singer:2009,
AUTHOR = {Singer, A. and Nelder, J. },
TITLE  = {Nelder-Mead algorithm},
YEAR  = {2009},
JOURNAL  = {Scholarpedia},
VOLUME  = {4},
NUMBER  = {7},
PAGES  = {2928}
}

@ARTICLE{Torczon98fromevolutionary,
    author = {Virginia Torczon and Michael W. Trosset},
    title = {From Evolutionary Operation to Parallel Direct Search: Pattern Search Algorithms for Numerical Optimization},
    journal = {Computing Science and Statistics},
    year = {1998},
    volume = {29},
    pages = {396--401}
}

@book{WaltersParkerMorganDeming1991,
 author = {Walters, F. S. and  Parker, L. R. and  Morgan, S. L. and Deming, S. N.},
 title = {Sequential Simplex Optimization for Quality and Productivity in Research, Development, and Manufacturing},
 year = {1991},
 publisher= {CRC Press, Boca Raton, FL},
 series = {Chemometrics series},
}

@ARTICLE{VanDerWiel1980,
  AUTHOR = {Van Der Wiel, P.F.A. },
  TITLE  = {Improvement of the super modified simplex optimisation procedure},
  YEAR  = {1980},
  JOURNAL  = {Analytica Chemica Acta},
  VOLUME  = {122},
  PAGES  = {421?-433},
}

@ARTICLE{Routh1977,
    author = {Routh, M. W. and Swartz, P.A. and Denton, M.B.},
    title = {Performance of the Super Modified Simplex},
    journal = {Analytical Chemistry},
    year = {1977},
    volume = {49},
    number = {9},
    pages = {1422--1428}
}

@MISC{Brent73algorithmsfor,
    author = {Richard P. Brent},
    title = {Algorithms for Minimization without Derivatives},
    year = {1973}
}

@book{Gill81MurrayWright,
	address = {London},
	author = {Gill, P. E.  and Murray, W.  and Wright, M. H. },
	citeulike-article-id = {1055426},
	keywords = {bibtex-import},
	posted-at = {2007-01-20 09:02:15},
	priority = {2},
	publisher = {Academic Press},
	title = {Practical optimization},
	year = {1981}
}