{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:10:17Z","timestamp":1749615017399,"version":"3.41.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319458229"},{"type":"electronic","value":"9783319458236"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45823-6_7","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T13:26:31Z","timestamp":1472563591000},"page":"69-79","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Global Optimization with Indefinite Kernels"],"prefix":"10.1007","author":[{"given":"Martin","family":"Zaefferer","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Bartz-Beielstein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1214\/aoms\/1177704477","volume":"33","author":"TW Anderson","year":"1962","unstructured":"Anderson, T.W.: On the distribution of the two-sample Cramer-von Mises criterion. Ann. Math. Stat. 33(3), 1148\u20131159 (1962)","journal-title":"Ann. Math. Stat."},{"key":"7_CR2","unstructured":"Ayhan, M.S., Chu, C.-H.H.: Towards indefinite gaussian processes. Technical report, University of Louisiana at Lafayette (2012)"},{"issue":"4","key":"7_CR3","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/j.cageo.2010.03.021","volume":"37","author":"JB Boisvert","year":"2011","unstructured":"Boisvert, J.B., Deutsch, C.V.: Programs for kriging and sequential Gaussian simulation with locally varying anisotropy using non-Euclidean distances. Comput. Geoscie. 37(4), 495\u2013510 (2011)","journal-title":"Comput. Geoscie."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Chen, Y., Gupta, M.R., Recht, B.: Learning kernels from indefinite similarities. In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, pp. 145\u2013152. ACM, New York (2009)","DOI":"10.1145\/1553374.1553393"},{"key":"7_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/9780470770801","volume-title":"Engineering Design via Surrogate Modelling","author":"A Forrester","year":"2008","unstructured":"Forrester, A., Sobester, A., Keane, A.: Engineering Design via Surrogate Modelling. Wiley, Hoboken (2008)"},{"issue":"4","key":"7_CR6","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1137\/0611042","volume":"11","author":"W Glunt","year":"1990","unstructured":"Glunt, W., Hayden, T.L., Hong, S., Wells, J.: An alternating projection algorithm for computing the nearest Euclidean distance matrix. SIAM J. Matrix Anal. Appl. 11(4), 589\u2013600 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-540-28649-3_27","volume-title":"Pattern Recognition","author":"B Haasdonk","year":"2004","unstructured":"Haasdonk, B., Bahlmann, C.: Learning with distance substitution kernels. In: Rasmussen, C.E., B\u00fclthoff, H.H., Sch\u00f6lkopf, B., Giese, M.A. (eds.) DAGM 2004. LNCS, vol. 3175, pp. 220\u2013227. Springer, Heidelberg (2004)"},{"issue":"3","key":"7_CR8","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1093\/imanum\/22.3.329","volume":"22","author":"NJ Higham","year":"2002","unstructured":"Higham, N.J.: Computing the nearest correlation matrix-a problem from finance. IMA J. Numer. Anal. 22(3), 329\u2013343 (2002)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"7_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00500-003-0328-5","volume":"9","author":"Y Jin","year":"2005","unstructured":"Jin, Y.: A comprehensive survey of fitness approximation in evolutionary computation. Soft Comput. 9(1), 3\u201312 (2005)","journal-title":"Soft Comput."},{"issue":"1","key":"7_CR10","doi-asserted-by":"crossref","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)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"7_CR11","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"DR Jones","year":"1998","unstructured":"Jones, D.R., Schonlau, M., Welch, W.J.: Efficient global optimization of expensive black-box functions. J. Glob. Optim. 13(4), 455\u2013492 (1998)","journal-title":"J. Glob. Optim."},{"issue":"6","key":"7_CR12","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/TPAMI.2015.2477830","volume":"38","author":"G Loosli","year":"2015","unstructured":"Loosli, G., Canu, S., Ong, C.: Learning SVM in Krein spaces. IEEE Trans. Pattern Anal. Mach. Intell. 38(6), 1204\u20131216 (2015)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"7_CR13","unstructured":"Manchuk, J.G., Deutsch, C.V.: Robust solution of normal (kriging) equations. Technical report, CCG Alberta (2007)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Mangasarian, O.L.: Generalized support vector machines. In: Smola, A.J., Bartlett, P., Sch\u00f6lkopf, B., Schuurmans, D. (eds.) Advances in Large Margin Classifiers, pp. 135\u2013146. MIT Press (2000)","DOI":"10.7551\/mitpress\/1113.003.0012"},{"key":"7_CR15","unstructured":"Mockus, J., Tiesis, V., Zilinskas, A.: The application of bayesian methods for seeking the extremum. In: Towards Global Optimization 2, pp. 117\u2013129. North-Holland, Amsterdam (1978)"},{"key":"7_CR16","unstructured":"Mohammadi, H., Le Riche, R., Durrande, N., Touboul, E., Bay, X.: An analytic comparison of regularization methods for Gaussian Processes. Research report, Ecole Nationale Sup\u00e9rieure des Mines de Saint-Etienne, LIMOS (2016)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/978-3-642-20364-0_13","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"A Moraglio","year":"2011","unstructured":"Moraglio, A., Kattan, A.: Geometric generalisation of surrogate model based optimisation to combinatorial spaces. In: Merz, P., Hao, J.-K. (eds.) EvoCOP 2011. LNCS, vol. 6622, pp. 142\u2013154. Springer, Heidelberg (2011)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Moraglio, A., Kim, Y.-H., Yoon, Y.: Geometric surrogate-based optimisation for permutation-based problems. In: Proceedings of the 13th Annual Conference Companion on Genetic and Evolutionary Computation, GECCO 2011, pp. 133\u2013134. ACM, New York (2011)","DOI":"10.1145\/2001858.2001934"},{"issue":"2","key":"7_CR19","doi-asserted-by":"crossref","first-page":"17","DOI":"10.21314\/JOR.2000.023","volume":"2","author":"R Rebonato","year":"1999","unstructured":"Rebonato, R., J\u00e4ckel, P.: The most general methodology to create a valid correlation matrix for risk management and option pricing purposes. J. Risk 2(2), 17\u201327 (1999)","journal-title":"J. Risk"},{"issue":"10","key":"7_CR20","doi-asserted-by":"crossref","first-page":"2039","DOI":"10.1162\/NECO_a_00770","volume":"27","author":"F-M Schleif","year":"2015","unstructured":"Schleif, F.-M., Tino, P.: Indefinite proximity learning: a review. Neural Comput. 27(10), 2039\u20132096 (2015)","journal-title":"Neural Comput."},{"key":"7_CR21","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4175.001.0001","volume-title":"Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond","author":"B Sch\u00f6lkopf","year":"2001","unstructured":"Sch\u00f6lkopf, B., Smola, A.J.: Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press, Cambridge (2001)"},{"key":"7_CR22","first-page":"301","volume-title":"Advances in Neural Information Processing Systems","author":"B Sch\u00f6lkopf","year":"2001","unstructured":"Sch\u00f6lkopf, B.: The kernel trick for distances. In: Leen, T.K., Dietterich, T.G., Tresp, V. (eds.) Advances in Neural Information Processing Systems, vol. 13, pp. 301\u2013307. MIT Press, Cambridge (2001)"},{"key":"7_CR23","unstructured":"Wagner, T.: Planning and multi-objective optimization of manufacturing processes by means of empirical surrogate models. Ph. D. thesis, TU Dortmund. Vulkan Verlag (2013)"},{"key":"7_CR24","unstructured":"Wu, G., Chang, E.Y., Zhang, Z.: An analysis of transformation on non-positive semidefinite similarity matrix for kernel machines. In: Proceedings of the 22nd International Conference on Machine Learning (2005)"},{"key":"7_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-3035-4","volume-title":"Practical Data Analysis for Designed Experiments","author":"BS Yandell","year":"1997","unstructured":"Yandell, B.S.: Practical Data Analysis for Designed Experiments. Chapman and Hall\/CRC, London (1997)"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/978-3-319-10762-2_37","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"M Zaefferer","year":"2014","unstructured":"Zaefferer, M., Stork, J., Bartz-Beielstein, T.: Distance measures for permutations in combinatorial efficient global optimization. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 373\u2013383. Springer, Heidelberg (2014)"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Zaefferer, M., Stork, J., Friese, M., Fischbach, A., Naujoks, B., Bartz-Beielstein, T.: Efficient global optimization for combinatorial problems. In: Genetic and Evolutionary Computation Conference, GECCO 2014, pp. 871\u2013878. ACM (2014)","DOI":"10.1145\/2576768.2598282"},{"issue":"1","key":"7_CR28","first-page":"49","volume":"16","author":"J Zhu","year":"2004","unstructured":"Zhu, J., Rosset, S., Hastie, T., Tibshirani, R.: 1-norm support vector machines. Adv. Neural Inf. Process. Syst. 16(1), 49\u201356 (2004)","journal-title":"Adv. Neural Inf. Process. Syst."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45823-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T15:31:29Z","timestamp":1749569489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45823-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458229","9783319458236"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45823-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}