{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T18:03:56Z","timestamp":1774289036950,"version":"3.50.1"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1986,3,1]],"date-time":"1986-03-01T00:00:00Z","timestamp":510019200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1986,3]]},"DOI":"10.1007\/bf01580583","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:41:26Z","timestamp":1114681286000},"page":"188-200","source":"Crossref","is-referenced-by-count":105,"title":["An algorithm for finding the global maximum of a multimodal, multivariate function"],"prefix":"10.1007","volume":"34","author":[{"given":"Regina Hunter","family":"Mladineo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Towards global optimisation 2","author":"L.C.W. Dixon","year":"1978","unstructured":"L.C.W. Dixon and G.P. Szeg\u00f6,Towards global optimisation 2 (North-Holland, Amsterdam 1978)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1090\/S0002-9939-1953-0055639-3","volume":"4","author":"J. Kiefer","year":"1953","unstructured":"J. Kiefer, \u201cSequential minimax search for a maximum\u201c,Proceedings of the American Mathematical Society 4 (1953) 502\u2013506.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"S.A. Pijavskii, \u201cAn algorithm for finding the absolute extremum of a function\u201d,USSR Computational Mathematics and Mathematical Physics (1972) 57\u201367.","DOI":"10.1016\/0041-5553(72)90115-2"},{"issue":"3","key":"CR4","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1137\/0709036","volume":"9","author":"B. Shubert","year":"1972","unstructured":"B. Shubert, \u201cA sequential method seeking the global maximum of a function\u201c,SIAM Journal of Numerical Analysis 9 (3) (1972) 379\u2013388.","journal-title":"SIAM Journal of Numerical Analysis"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"A.G. Sukharev, \u201cA stochastic algorithm for extremum search, optimal in one step\u201d,USSR Computational Mathematics and Mathematical Physics (1981) 23\u201339.","DOI":"10.1016\/0041-5553(81)90147-6"},{"key":"CR6","volume-title":"Optimum seeking methods","author":"D.J. Wilde","year":"1964","unstructured":"D.J. Wilde,Optimum seeking methods (Prentice Hall, Englewood Cliffs, New Jersey, 1964)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580583.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580583\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:09Z","timestamp":1556896329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580583"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["BF01580583"],"URL":"https:\/\/doi.org\/10.1007\/bf01580583","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}