乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T11:33:05Z","timestamp":1703158385948},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T00:00:00Z","timestamp":1473897600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s10898-016-0465-x","type":"journal-article","created":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T05:09:04Z","timestamp":1473916144000},"page":"1-21","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Parallel distributed block coordinate descent methods based on pairwise comparison oracle"],"prefix":"10.1007","volume":"69","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-2475-6131","authenticated-orcid":false,"given":"Kota","family":"Matsui","sequence":"first","affiliation":[]},{"given":"Wataru","family":"Kumagai","sequence":"additional","affiliation":[]},{"given":"Takafumi","family":"Kanamori","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,15]]},"reference":[{"issue":"3","key":"465_CR1","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1137\/S1052623400378742","volume":"13","author":"C Audet","year":"2002","unstructured":"Audet, C., Dennis Jr., J.E.: Analysis of generalized pattern searches. SIAM J. Optim. 13(3), 889\u2013903 (2002)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"465_CR2","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1137\/070707518","volume":"19","author":"C Audet","year":"2008","unstructured":"Audet, C., Dennis Jr., J.E., Digabel, S.L.: Parallel space decomposition of the mesh adaptive direct search algorithm. SIAM J. Optim. 19(3), 1150\u20131170 (2008)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"465_CR3","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1137\/120895056","volume":"24","author":"C Audet","year":"2014","unstructured":"Audet, C., Ianni, A., Le Digabel, S., Tribes, C.: Reducing the number of function evaluations in mesh adaptive direct search algorithms. SIAM J. Optim. 24(2), 621\u2013642 (2014)","journal-title":"SIAM J. Optim."},{"key":"465_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"SP Boyd","year":"2004","unstructured":"Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"465_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization","author":"AAR Conn","year":"2009","unstructured":"Conn, A.A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization, vol. 8. SIAM, Philadelphia (2009)"},{"issue":"1","key":"465_CR6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/10556788.2011.623162","volume":"28","author":"AR Conn","year":"2013","unstructured":"Conn, A.R., Le Digabel, S.: Use of quadratic models with mesh-adaptive direct search for constrained black box optimization. Optim. Methods Softw. 28(1), 139\u2013158 (2013)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"465_CR7","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1093\/imanum\/drn045","volume":"28","author":"A Cust\u00f3dio","year":"2008","unstructured":"Cust\u00f3dio, A., Dennis, J., Vicente, L.N.: Using simplex gradients of nonsmooth functions in direct search methods. IMA J. Numer. Anal. 28(4), 770\u2013784 (2008)","journal-title":"IMA J. Numer. Anal."},{"key":"465_CR8","unstructured":"Flaxman, A.D., Kalai, A.T., McMahan, H.B.: Online convex optimization in the bandit setting: gradient descent without a gradient. In: Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms. SODA \u201905, pp. 385\u2013394. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2005)"},{"key":"465_CR9","unstructured":"Fu, M.C.: Gradient estimation. In: Henderson, S.G., Nelson, B.L. (eds.) Handbooks in Operations Research and Management Science: Simulation, Chap. 19. Elservier, Amsterdam (2006)"},{"issue":"1","key":"465_CR10","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10589-010-9329-3","volume":"51","author":"F Gao","year":"2012","unstructured":"Gao, F., Han, L.: Implementing the Nelder\u2013Mead simplex algorithm with adaptive parameters. Comput. Optim. Appl. 51(1), 259\u2013277 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"465_CR11","unstructured":"Jamieson, K.G., Nowak, R.D., Recht, B.: Query complexity of derivative-free optimization. In: NIPS, pp. 2681\u20132689 (2012)"},{"key":"465_CR12","doi-asserted-by":"crossref","unstructured":"K\u00e4\u00e4ri\u00e4inen, M.: Active learning in the non-realizable case. In: Algorithmic Learning Theory, pp. 63\u201377. Springer (2006)","DOI":"10.1007\/11894841_9"},{"key":"465_CR13","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1137\/S1052623496303470","volume":"9","author":"JC Lagarias","year":"1998","unstructured":"Lagarias, J.C., Reeds, J.A., Wright, M.H., Wright, P.E.: Convergence properties of the Nelder\u2013Mead simplex method in low dimensions. SIAM J. Optim. 9, 112\u2013147 (1998)","journal-title":"SIAM J. Optim."},{"key":"465_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-74503-9","volume-title":"Linear and Nonlinear Programming","author":"D Luenberger","year":"2008","unstructured":"Luenberger, D., Ye, Y.: Linear and Nonlinear Programming. Springer, Berlin (2008)"},{"key":"465_CR15","volume-title":"Foundations of Machine Learning","author":"M Mohri","year":"2012","unstructured":"Mohri, M., Rostamizadeh, A., Talwalkar, A.: Foundations of Machine Learning. MIT Press, London (2012)"},{"issue":"4","key":"465_CR16","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7(4), 308\u2013313 (1965)","journal-title":"Comput. J."},{"key":"465_CR17","unstructured":"R Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2014). http:\/\/www.R-project.org\/"},{"key":"465_CR18","doi-asserted-by":"crossref","unstructured":"Ramdas, A., Singh, A.: Algorithmic connections between active learning and stochastic convex optimization. In: Algorithmic Learning Theory, pp. 339\u2013353. Springer (2013)","DOI":"10.1007\/978-3-642-40935-6_24"},{"key":"465_CR19","doi-asserted-by":"crossref","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Parallel coordinate descent methods for big data optimization. Math. Program. 156(1\u20132), 433\u2013484 (2016)","DOI":"10.1007\/s10107-015-0901-6"},{"issue":"3","key":"465_CR20","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"LM Rios","year":"2013","unstructured":"Rios, L.M., Sahinidis, N.V.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Glob. Optim. 56(3), 1247\u20131293 (2013)","journal-title":"J. Glob. Optim."},{"key":"465_CR21","doi-asserted-by":"crossref","unstructured":"Yue, Y., Joachims, T.: Interactively optimizing information retrieval systems as a dueling bandits problem. In: Proceedings of the 26th Annual International Conference on Machine Learning, pp. 1201\u20131208. ACM (2009)","DOI":"10.1145\/1553374.1553527"},{"issue":"5","key":"465_CR22","doi-asserted-by":"crossref","first-page":"1538","DOI":"10.1016\/j.jcss.2011.12.028","volume":"78","author":"Y Yue","year":"2012","unstructured":"Yue, Y., Broder, J., Kleinberg, R., Joachims, T.: The k-armed dueling bandits problem. J. Comput. Syst. Sci. 78(5), 1538\u20131556 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"465_CR23","unstructured":"Zoghi, M., Whiteson, S., Munos, R., de\u00a0Rijke, M.: Relative upper confidence bound for the K-armed dueling bandit problem. In: ICML 2014: Proceedings of the Thirty-First International Conference on Machine Learning, pp. 10\u201318 (2014)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-016-0465-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0465-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0465-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T10:32:15Z","timestamp":1568370735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-016-0465-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,15]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["465"],"URL":"https:\/\/doi.org\/10.1007\/s10898-016-0465-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,15]]}}}