{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T05:57:23Z","timestamp":1742795843812},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648918"},{"type":"electronic","value":"9783540685159"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0040783","type":"book-chapter","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T08:05:14Z","timestamp":1139213114000},"page":"301-312","source":"Crossref","is-referenced-by-count":3,"title":["On the application of evolutionary pattern search algorithms"],"prefix":"10.1007","author":[{"given":"William E.","family":"Hart","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,12,10]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1997-9","volume-title":"A Connectionist Machine for Genetic Hillclimbing","author":"D. H. Ackley","year":"1987","unstructured":"D. H. Ackley, A Connectionist Machine for Genetic Hillclimbing, Kluwer Academic Publishers, Boston, 1987."},{"unstructured":"J. J. Dennis and R. B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, 1983.","key":"30_CR2"},{"doi-asserted-by":"crossref","unstructured":"L. J. Eshelman, The CHC adaptive search algorithm: How to have a safe search when engaging in nontraditional genetic recombination, in Foundations of Genetic Algorithms, G. J. Rawlins, ed., Morgan-Kaufmann, 1991, pp. 265\u2013285.","key":"30_CR3","DOI":"10.1016\/B978-0-08-050684-5.50020-3"},{"key":"30_CR4","first-page":"301","volume-title":"Foundations of Genetic Algorithms","author":"D. E. Goldberg","year":"1991","unstructured":"D. E. Goldberg and K. Deb, A comparative analysis of selection schemes used in genetic algorithms, in Foundations of Genetic Algorithms, G. J. Rawlins, ed., Morgan-Kauffmann, San Mateo, CA, 1991, pp. 301\u2013315."},{"key":"30_CR5","first-page":"127","volume-title":"A generalized stationary point convergence theory for evolutionary algorithms","author":"W. E. Hart","year":"1997","unstructured":"W. E. Hart, A generalized stationary point convergence theory for evolutionary algorithms, in Proc 7th Intl Conf on Genetic Algorithms (ICGA97), T. Baeck, ed., San Francisco, CA, 1997, Morgan Kaufmann, pp. 127\u2013134."},{"key":"30_CR6","first-page":"325","volume-title":"Foundations of Genetic Algorithms 4","author":"W. E. Hart","year":"1997","unstructured":"-, A stationary point convergence theory for evolutionary algorithms, in Foundations of Genetic Algorithms 4, R. K. Belew and M. D. Vose, eds., San Fransico, CA, 1997, Morgan Kaufmann Pub, Inc., pp. 325\u2013342."},{"unstructured":"-, Stochastic pattern search and evolutionary algorithms, SIAM J Optimization, (1997). (submitted).","key":"30_CR7"},{"key":"30_CR8","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1002\/jcc.540150606","volume":"15","author":"J. Meza","year":"1994","unstructured":"J. Meza and M. L. Martinez, Direct search methods for the molecular conformotion problem, Journal of Computational Chemistry, 15 (1994), pp. 627\u2013632.","journal-title":"Journal of Computational Chemistry"},{"key":"30_CR9","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/S0167-8191(05)80052-3","volume":"17","author":"H. M\u00fchlenbein","year":"1991","unstructured":"H. M\u00fchlenbein, M. Schomisch, and J. Born, The parallel genetic algorithm as function optimizer, Parallel Computing, 17 (1991), pp. 619\u2013632.","journal-title":"Parallel Computing"},{"unstructured":"W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling, Numerical Recipies in C \u2014 The Art of Scientific Computing, Cambridge University Press, 1990.","key":"30_CR10"},{"key":"30_CR11","first-page":"155","volume-title":"Performance degradation of genetic algorithms under coordinate rotation","author":"R. Salomon","year":"1996","unstructured":"R. Salomon, Performance degradation of genetic algorithms under coordinate rotation, in Proc. of the Fifth Annual Conf. on Evolutionary Programming, L. J. Fogel, P. Angeline, and T. B\u00e4ck, eds., Cambridge, Massachusetts, 1996, MIT Press, pp. 155\u2013161."},{"unstructured":"V. Torczon, Multi-directional search: A direct search algorithm for parallel machines, Tech. Rep. TR90-7, Rice University, May 1989.","key":"30_CR12"},{"unstructured":"-, May 1996. Personal Communication.","key":"30_CR13"},{"key":"30_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1052623493250780","volume":"7","author":"V. Torczon","year":"1997","unstructured":"-, On the convergence of pattern search methods, SIAM J Optimization, 7 (1997), pp. 1\u201325.","journal-title":"SIAM J Optimization"},{"unstructured":"M. Wright, Direct search methods: Once scorned, now respected, Tech. Rep. 96-4-01, Computing Science Research Center, AT&T Bell Laboratories, 1996.","key":"30_CR15"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Programming VII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040783","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T15:13:27Z","timestamp":1555427607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040783"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648918","9783540685159"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0040783","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}