{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:35Z","timestamp":1740123695125,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T00:00:00Z","timestamp":1696982400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T00:00:00Z","timestamp":1696982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"NSERC Discovery Grant"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF - 1812746"],"award-info":[{"award-number":["CCF - 1812746"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s11075-023-01668-w","type":"journal-article","created":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T12:02:49Z","timestamp":1697025769000},"page":"845-877","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Max-convolution through numerics and tropical\u00a0geometry"],"prefix":"10.1007","volume":"96","author":[{"given":"Taylor","family":"Brysiewicz","sequence":"first","affiliation":[]},{"given":"Jonathan D.","family":"Hauenstein","sequence":"additional","affiliation":[]},{"given":"Caroline","family":"Hills","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,11]]},"reference":[{"issue":"1","key":"1668_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01581628","volume":"19","author":"I Zang","year":"1980","unstructured":"Zang, I.: A smoothing-out technique for min-max optimization. Math. Programming. 19(1), 61\u201377 (1980)","journal-title":"Math. Programming."},{"key":"1668_CR2","doi-asserted-by":"crossref","unstructured":"Zhao, G., Wang, Z., Mou, H.: Uniform approximation of min\/max functions by smooth splines. J. Comput. Appl. Math. 236(5), 699\u2013703 (2011). The 7th International Conference on Scientific Computing and Applications, June 13\u201316, 2010, Dalian, China","DOI":"10.1016\/j.cam.2011.06.023"},{"key":"1668_CR3","unstructured":"Asadi, K., Littman, M.L.: An alternative softmax operator for reinforcement learning. In: Proceedings of the 34th International Conference on Machine Learning, Vol 70. ICML\u201917, pp. 243\u2013252. JMLR.org, (Online) (2017)"},{"key":"1668_CR4","unstructured":"Liu, W., Wen, Y., Yu, Z., Yang, M.: Large-margin softmax loss for convolutional neural networks. In: Balcan, M., Weinberger, K. (eds.) International Conference on Machine Learning, Vol 48. Proceedings of Machine Learning Research, vol. 48 (2016). 33rd International Conference on Machine Learning, New York, NY, JUN 20\u201322, 2016"},{"key":"1668_CR5","doi-asserted-by":"publisher","unstructured":"Nielsen, F., Sun, K.: Guaranteed bounds on information-theoretic measures of univariate mixtures using piecewise log-sum-exp inequalities. Entropy. 18(12) (2016). https:\/\/doi.org\/10.3390\/e18120442","DOI":"10.3390\/e18120442"},{"key":"1668_CR6","doi-asserted-by":"publisher","unstructured":"Blanchard, P., Higham, D.J., Higham, N.J.: Accurately computing the log-sum-exp and softmax functions. IMA J. Numer. Anal. 41(4), 2311\u20132330 (2020). https:\/\/doi.org\/10.1093\/imanum\/draa038. https:\/\/academic.oup.com\/imajna\/articlepdf\/41\/4\/2311\/40758053\/draa038.pdf","DOI":"10.1093\/imanum\/draa038"},{"issue":"3","key":"1668_CR7","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/130932132","volume":"56","author":"LN Trefethen","year":"2014","unstructured":"Trefethen, L.N., Weideman, J.A.C.: The exponentially convergent trapezoidal rule. SIAM Review. 56(3), 385\u2013458 (2014)","journal-title":"SIAM Review."},{"key":"1668_CR8","first-page":"36","volume":"17","author":"J Pfeuffer","year":"2016","unstructured":"Pfeuffer, J., Serang, O.: A bounded p-norm approximation of max-convolution for sub-quadratic Bayesian inference on additive factors. J. Mach. Learn. Res. 17, 36\u201313639 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"1668_CR9","doi-asserted-by":"publisher","unstructured":"Serang, O.: A fast numerical method for max-convolution and the application to efficient max-product inference in bayesian networks. J. Comput. Biol. J. Mol. Cell. Biol. 22 (2015). https:\/\/doi.org\/10.1089\/cmb.2015.0013","DOI":"10.1089\/cmb.2015.0013"},{"key":"1668_CR10","doi-asserted-by":"crossref","unstructured":"Maclagan, D., Sturmfels, B.: Introduction to tropical geometry. Graduate Studies in Mathematics, vol. 161. American Mathematical Society, Providence, Rhode Island (2015)","DOI":"10.1090\/gsm\/161"},{"key":"1668_CR11","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1090\/S0002-9947-1971-0280489-8","volume":"157","author":"GM Bergman","year":"1971","unstructured":"Bergman, G.M.: The logarithmic limit-set of an algebraic variety. Trans. Am. Math. Soc. 157, 459\u2013469 (1971)","journal-title":"Trans. Am. Math. Soc."},{"key":"1668_CR12","unstructured":"DeWolff, T., Schroeter, F.: The boundary of amoebas. arXiv Preprint: - arXiv:1310.7363 (2013)"},{"key":"1668_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1006\/aima.1999.1856","volume":"151","author":"M Forsberg","year":"2000","unstructured":"Forsberg, M., Passare, M., Tsikh, A.: Laurent determinants and arrangements of hyperplane amoebas. Adv. Math. 151, 45\u201370 (2000)","journal-title":"Adv. Math."},{"key":"1668_CR14","doi-asserted-by":"crossref","unstructured":"Moenck, R.T.: Practical fast polynomial multiplication. In: Proceedings of the Third ACM Symposium on Symbolic and Algebraic Computation. SYMSAC\u2019 76, pp. 136\u2013148. Association for Computing Machinery, New York, NY, USA (1976)","DOI":"10.1145\/800205.806332"},{"key":"1668_CR15","doi-asserted-by":"crossref","unstructured":"Cygan, M., Mucha, M., Wundefinedgrzycki, K., W\u0142odarczyk, M.: On problems equivalent to (min,+)-convolution. ACM Trans. Algorithms 15(1) (2019)","DOI":"10.1145\/3293465"},{"key":"1668_CR16","doi-asserted-by":"publisher","unstructured":"Van Bemten, A., Kellerer, W.: Network calculus: a comprehensive guide (2016). https:\/\/doi.org\/10.13140\/RG.2.2.32305.89448","DOI":"10.13140\/RG.2.2.32305.89448"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01668-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-023-01668-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01668-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T08:19:30Z","timestamp":1716193170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-023-01668-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,11]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["1668"],"URL":"https:\/\/doi.org\/10.1007\/s11075-023-01668-w","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2023,10,11]]},"assertion":[{"value":"7 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}