{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:28Z","timestamp":1740099628759,"version":"3.37.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030386283"},{"type":"electronic","value":"9783030386290"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38629-0_31","type":"book-chapter","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T14:05:05Z","timestamp":1579615505000},"page":"383-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Bayesian Optimization Approaches for Massively Multi-modal Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3574-6681","authenticated-orcid":false,"given":"Ibai","family":"Roman","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7271-1931","authenticated-orcid":false,"given":"Alexander","family":"Mendiburu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1005-8535","authenticated-orcid":false,"given":"Roberto","family":"Santana","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4683-8111","authenticated-orcid":false,"given":"Jose A.","family":"Lozano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"31_CR1","unstructured":"Brochu, E., Cora, V.M., de Freitas, N.: A tutorial on Bayesian optimization of expensive cost functions, with application to active user modeling and hierarchical reinforcement learning, December 2010. arXiv:1012.2599"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Fieldsend, J.E.: Running up those hills: multi-modal search with the niching migratory multi-swarm optimiser. In: 2014 IEEE Congress on Evolutionary Computation (CEC), pp. 2593\u20132600. IEEE (2014)","DOI":"10.1109\/CEC.2014.6900309"},{"key":"31_CR3","unstructured":"Ginsbourger, D., Riche, R.L., Carraro, L.: A multi-points criterion for deterministic parallel global optimization based on Gaussian processes. Technical report, CCSD, March 2008. https:\/\/hal.archives-ouvertes.fr\/hal-00260579\/document"},{"key":"31_CR4","unstructured":"Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multi-modal function optimisation. In: Proceedings of the of Second International Conference on Genetic Algorithms and Their Applications, pp. 41\u201349 (1987)"},{"key":"31_CR5","unstructured":"Gonz\u00e1lez, J., Dai, Z., Hennig, P., Lawrence, N.D.: Batch Bayesian optimization via local penalization (2015). arXiv:1505.08052"},{"key":"31_CR6","unstructured":"Guhaniyogi, R., Li, C., Savitsky, T.D., Srivastava, S.: A divide-and-conquer Bayesian approach to large-scale kriging, December 2017. arXiv:1712.09767"},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00941892","volume":"79","author":"DR Jones","year":"1993","unstructured":"Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the Lipschitz constant. J. Optim. Theory Appl. 79(1), 157\u2013181 (1993). https:\/\/doi.org\/10.1007\/BF00941892","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"31_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1023\/A:1012771025575","volume":"21","author":"DR Jones","year":"2001","unstructured":"Jones, D.R.: A taxonomy of global optimization methods based on response surfaces. J. Global Optim. 21(4), 345\u2013383 (2001). https:\/\/doi.org\/10.1023\/A:1012771025575","journal-title":"J. Global Optim."},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.advengsoft.2014.09.014","volume":"80","author":"DE Kvasov","year":"2015","unstructured":"Kvasov, D.E., Sergeyev, Y.D.: Deterministic approaches for solving practical black-box global optimization problems. Adv. Eng. Softw. 80, 58\u201366 (2015). https:\/\/doi.org\/10.1016\/j.advengsoft.2014.09.014 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S096599781400163X","journal-title":"Adv. Eng. Softw."},{"key":"31_CR10","unstructured":"Li, X., Engelbrecht, A., Epitropakis, M.G.: Benchmark functions for CEC 2013 special session and competition on niching methods for multimodal function optimization. Technical report, Royal Melbourne Institute of Technology, March 2013. http:\/\/goanna.cs.rmit.edu.au\/xiaodong\/cec13-niching\/"},{"key":"31_CR11","series-title":"Mathematics and Its Applications","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-94-009-0909-0_7","volume-title":"Bayesian Approach to Global Optimization","author":"J Mockus","year":"1989","unstructured":"Mockus, J.: The Bayesian approach to local optimization. In: Mockus, J. (ed.) Bayesian Approach to Global Optimization. Mathematics and Its Applications, vol. 37, pp. 125\u2013156. Springer, Dordrecht (1989). https:\/\/doi.org\/10.1007\/978-94-009-0909-0_7"},{"key":"31_CR12","doi-asserted-by":"publisher","unstructured":"Petrowski, A.: A clearing procedure as a niching method for genetic algorithms. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 798\u2013803 (1996). https:\/\/doi.org\/10.1109\/ICEC.1996.542703","DOI":"10.1109\/ICEC.1996.542703"},{"issue":"2","key":"31_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1093\/comjnl\/7.2.155","volume":"7","author":"MJD Powell","year":"1964","unstructured":"Powell, M.J.D.: An efficient method for finding the minimum of a function of several variables without calculating derivatives. Comput. J. 7(2), 155\u2013162 (1964). https:\/\/doi.org\/10.1093\/comjnl\/7.2.155 . http:\/\/comjnl.oxfordjournals.org\/content\/7\/2\/155","journal-title":"Comput. J."},{"key":"31_CR14","doi-asserted-by":"publisher","unstructured":"Preuss, M.: Niching the CMA-ES via nearest-better clustering. In: Proceedings of the 12th Annual Conference Companion on Genetic and Evolutionary Computation, GECCO 2010, pp. 1711\u20131718. ACM, New York (2010). https:\/\/doi.org\/10.1145\/1830761.1830793","DOI":"10.1145\/1830761.1830793"},{"key":"31_CR15","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07407-8","volume-title":"Multimodal Optimization by Means of Evolutionary Algorithms","author":"M Preuss","year":"2015","unstructured":"Preuss, M.: Multimodal Optimization by Means of Evolutionary Algorithms. Natural Computing Series. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-07407-8"},{"issue":"Dec","key":"31_CR16","first-page":"1939","volume":"6","author":"J Qui\u00f1onero-Candela","year":"2005","unstructured":"Qui\u00f1onero-Candela, J., Rasmussen, C.E.: A unifying view of sparse approximate Gaussian process regression. J. Mach. Learn. Res. 6(Dec), 1939\u20131959 (2005). http:\/\/www.jmlr.org\/papers\/v6\/quinonero-candela05a","journal-title":"J. Mach. Learn. Res."},{"key":"31_CR17","volume-title":"Gaussian Processes for Machine Learning","author":"CE Rasmussen","year":"2006","unstructured":"Rasmussen, C.E., Williams, C.K.: Gaussian Processes for Machine Learning. MIT Press, Cambridge (2006)"},{"key":"31_CR18","unstructured":"Roman, I., Santana, R., Mendiburu, A., Lozano, J.A.: Dynamic kernel selection criteria for Bayesian optimization. In: BayesOpt 2014: NIPS Workshop on Bayesian Optimization, Montreal (2014). http:\/\/bayesopt.github.io\/papers\/paper13.pdf"},{"issue":"3","key":"31_CR19","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/4235.735432","volume":"2","author":"B Sareni","year":"1998","unstructured":"Sareni, B., Krahenbuhl, L.: Fitness sharing and niching methods revisited. IEEE Trans. Evol. Comput. 2(3), 97\u2013106 (1998)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"31_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1985.tb01327.x","volume":"47","author":"BW Silverman","year":"1985","unstructured":"Silverman, B.W.: Some aspects of the spline smoothing approach to non-parametric regression curve fitting. J. Roy. Stat. Soc. Series B (Method.) 47(1), 1\u201352 (1985)","journal-title":"J. Roy. Stat. Soc. Series B (Method.)"},{"key":"31_CR21","doi-asserted-by":"publisher","unstructured":"Singh, G., Deb, K.: Comparison of multi-modal optimization algorithms based on evolutionary algorithms. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, GECCO 2006, pp. 1305\u20131312. ACM, New York (2006). https:\/\/doi.org\/10.1145\/1143997.1144200","DOI":"10.1145\/1143997.1144200"},{"key":"31_CR22","unstructured":"Srinivas, N., Krause, A., Kakade, S., Seeger, M.: Gaussian process optimization in the bandit setting: no regret and experimental design. In: Proceedings of the 27th International Conference on Machine Learning (ICML 2010), Haifa, 21\u201324 June 2010, pp. 1015\u20131022 (2010). http:\/\/www.icml2010.org\/papers\/422.pdf"},{"key":"31_CR23","doi-asserted-by":"publisher","unstructured":"Wang, H., van Stein, B., Emmerich, M., B\u00e4ck, T.: Time complexity reduction in efficient global optimization using cluster kriging. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 889\u2013896. ACM, New York (2017). https:\/\/doi.org\/10.1145\/3071178.3071321","DOI":"10.1145\/3071178.3071321"},{"key":"31_CR24","doi-asserted-by":"publisher","unstructured":"Wong, K.C., Leung, K.S., Wong, M.H.: Protein structure prediction on a lattice model via multimodal optimization techniques. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, GECCO 2010, pp. 155\u2013162. ACM, New York (2010). https:\/\/doi.org\/10.1145\/1830483.1830513","DOI":"10.1145\/1830483.1830513"},{"issue":"3","key":"31_CR25","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0378-7796(91)90001-4","volume":"22","author":"X Yin","year":"1991","unstructured":"Yin, X., Germay, N.: Investigations on solving the load flow problem by genetic algorithms. Electr. Power Syst. Res. 22(3), 151\u2013163 (1991). https:\/\/doi.org\/10.1016\/0378-7796(91)90001-4 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/0378779691900014","journal-title":"Electr. Power Syst. Res."},{"key":"31_CR26","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-0-387-74740-8_4","volume-title":"Stochastic Global Optimization","author":"A Zhigljavsky","year":"2008","unstructured":"Zhigljavsky, A., \u017dilinskas, A.: Methods based on statistical models of multimodal functions. In: Zhigljavsky, A., \u017dilinskas, A. (eds.) Stochastic Global Optimization. Springer Optimization and Its Applications, vol. 9, pp. 149\u2013244. Springer, Boston (2008). https:\/\/doi.org\/10.1007\/978-0-387-74740-8_4"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38629-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T12:46:59Z","timestamp":1722343619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38629-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030386283","9783030386290"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38629-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chania, Crete","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lion13.pem.tuc.gr\/en\/home\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}