{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:27:40Z","timestamp":1775003260529,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,3,22]],"date-time":"2013-03-22T00:00:00Z","timestamp":1363910400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s10107-013-0666-8","type":"journal-article","created":{"date-parts":[[2013,3,21]],"date-time":"2013-03-21T02:42:00Z","timestamp":1363833720000},"page":"161-184","source":"Crossref","is-referenced-by-count":9,"title":["Computing the conjugate of convex piecewise linear-quadratic bivariate functions"],"prefix":"10.1007","volume":"139","author":[{"given":"Bryan","family":"Gardiner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"Lucet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,22]]},"reference":[{"issue":"2","key":"666_CR1","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1137\/070687542","volume":"19","author":"HH Bauschke","year":"2008","unstructured":"Bauschke, H.H., Goebel, R., Lucet, Y., Wang, X.: The proximal average: basic theory. SIAM J. Optim. 19(2), 768\u2013785 (2008). doi: 10.1137\/070687542","journal-title":"SIAM J. Optim."},{"key":"666_CR2","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Lucet, Y., Trienis, M.: How to transform one convex function continuously into another. SIAM Rev. 50(1), 115\u2013132 (2008). URL: http:\/\/link.aip.org\/link\/?SIR\/50\/115\/1","DOI":"10.1137\/060664513"},{"key":"666_CR3","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Lucet, Y., Wang, X.: Primal-dual symmetric intrinsic methods for finding antiderivatives of cyclically monotone operators. SIAM J. Control Optim. 46(6), 2031\u20132051 (2007). URL: http:\/\/link.aip.org\/link\/?SJC\/46\/2031\/1","DOI":"10.1137\/060675794"},{"issue":"5","key":"666_CR4","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/j.na.2003.10.010","volume":"56","author":"HH Bauschke","year":"2004","unstructured":"Bauschke, H.H., Matou\u0161kov\u00e1, E., Reich, S.: Projection and proximal point methods: Convergence results and counterexamples. Nonlinear Anal. 56(5), 715\u2013738 (2004). doi: 10.1016\/j.na.2003.10.010","journal-title":"Nonlinear Anal."},{"key":"666_CR5","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Moffat, S.M., Wang, X.: Self-dual smooth approximations of convex functions via the proximal average. In: Bauschke, H.H., Burachik, R.S., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering, Springer Optimization and Its Applications, vol. 49, pp. 23\u201332. Springer, New York (2011). doi: 10.1007\/978-1-4419-9569-8_2","DOI":"10.1007\/978-1-4419-9569-8_2"},{"key":"666_CR6","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Mohrenschildt, M.V.: Symbolic computation of Fenchel conjugates. ACM Commun. Comput. Algebra 40(1), 18\u201328 (2006). doi: 10.1145\/1151446.1151453","DOI":"10.1145\/1151446.1151453"},{"key":"666_CR7","doi-asserted-by":"crossref","unstructured":"Borwein, J.M., Hamilton, C.H.: Symbolic Fenchel conjugation. Math. Program. 116(1), 17\u201335 (2008). doi: 10.1007\/s10107-007-0134-4","DOI":"10.1007\/s10107-007-0134-4"},{"key":"666_CR8","unstructured":"Botelho, F.C., Lacerda, A., Menezes, G.V., Ziviani, N.: Minimal perfect hashing: a competitive method for indexing internal memory. Inf. Sci. 181(13), 2608\u20132625 (2011). URL: http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025509005271"},{"key":"666_CR9","first-page":"587","volume":"308","author":"Y Brenier","year":"1989","unstructured":"Brenier, Y.: Un algorithme rapide pour le calcul de transform\u00e9es de Legendre-Fenchel discr\u00e8tes. C. R. Acad. Sci. Paris S\u00e9r. I Math. 308, 587\u2013589 (1989)","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. I Math."},{"key":"666_CR10","unstructured":"CGAL, Computational Geometry Algorithms Library. URL: http:\/\/www.cgal.org"},{"key":"666_CR11","unstructured":"CGLAB a Scilab toolbox for geometry based on CGAL. URL: http:\/\/cglab.gforge.inria.fr\/"},{"key":"666_CR12","unstructured":"Corrias, L.: Fast Legendre-Fenchel transform and applications to Hamilton-Jacobi equations and conservation laws. SIAM J. Numer. Anal. 33(4), 1534\u20131558 (1996). URL: http:\/\/www.jstor.org\/stable\/2158316"},{"key":"666_CR13","unstructured":"Czech, Z.J., Havas, G., Majewski, B.S.: Perfect hashing. Theor. Comput. Sci. 182(1\u20132), 1\u2013143 (1997). URL: http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397596001466"},{"key":"666_CR14","doi-asserted-by":"crossref","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, 3rd edn. Springer, Berlin (2008). URL: http:\/\/www.springer.com\/computer\/theoretical+computer+science\/book\/978-3-540-77973-5 . Algorithms and applications","DOI":"10.1007\/978-3-540-77974-2"},{"key":"666_CR15","doi-asserted-by":"crossref","unstructured":"Gardiner, B., Lucet, Y.: Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis. Set-Valued Var. Anal. 18(3\u20134), 467\u2013482 (2010). doi: 10.1007\/s11228-010-0157-5","DOI":"10.1007\/s11228-010-0157-5"},{"key":"666_CR16","doi-asserted-by":"crossref","unstructured":"Gardiner, B., Lucet, Y.: Graph-matrix calculus for computational convex analysis. In: Bauschke, H.H., Burachik, R.S., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering, Springer Optimization and Its Applications, vol. 49, pp. 243\u2013259. Springer, New York (2011). doi: 10.1007\/978-1-4419-9569-8_12","DOI":"10.1007\/978-1-4419-9569-8_12"},{"key":"666_CR17","unstructured":"Goebel, R.: Self-dual smoothing of convex and saddle functions. J. Convex Anal. 15(1), 179\u2013190 (2008). URL: http:\/\/www.heldermann.de\/JCA\/JCA15\/JCA151\/jca15012.htm"},{"key":"666_CR18","volume-title":"Data Structures and Algorithms in Java","author":"MT Goodrich","year":"2010","unstructured":"Goodrich, M.T., Tamassia, R.: Data Structures and Algorithms in Java, 5th edn. Wiley, New York (2010)","edition":"5"},{"key":"666_CR19","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 305\u2013306. Springer, Berlin (1993). URL: http:\/\/www.springer.com\/math\/book\/978-3-540-56850-6 . Vol I: Fundamentals, Vol II: Advanced theory and bundle methods"},{"key":"666_CR20","doi-asserted-by":"crossref","unstructured":"Johnstone, J., Koch, V., Lucet, Y.: Convexity of the proximal average. J. Optim. Theory Appl. 148, 107\u2013124 (2011). doi: 10.1007\/s10957-010-9747-5","DOI":"10.1007\/s10957-010-9747-5"},{"key":"666_CR21","unstructured":"Lucet, Y.: A fast computational algorithm for the Legendre-Fenchel transform. Comput. Optim. Appl. 6(1), 27\u201357 (1996). URL: http:\/\/www.springerlink.com\/content\/x777265871618672\/"},{"key":"666_CR22","unstructured":"Lucet, Y.: Computational Convex Analysis Library (1996\u20132011). URL: https:\/\/people.ok.ubc.ca\/ylucet\/cca.html"},{"key":"666_CR23","doi-asserted-by":"crossref","unstructured":"Lucet, Y.: Faster than the Fast Legendre Transform, the Linear-time Legendre Transform. Numer. Algorithms 16(2), 171\u2013185 (1997). URL: http:\/\/www.springerlink.com\/content\/m41t352758814q50\/","DOI":"10.1023\/A:1019191114493"},{"key":"666_CR24","doi-asserted-by":"crossref","unstructured":"Lucet, Y.: A linear Euclidean distance transform algorithm based on the Linear-time Legendre Transform. In: Proceedings of the Second Canadian Conference on Computer and Robot Vision (CRV 2005), pp. 262\u2013267. IEEE Computer Society Press, Victoria BC (2005)","DOI":"10.1109\/CRV.2005.7"},{"key":"666_CR25","doi-asserted-by":"crossref","unstructured":"Lucet, Y.: Fast Moreau envelope computation I: numerical algorithms. Numer. Algorithms 43(3), 235\u2013249 (2006). doi: 10.1007\/s11075-006-9056-0 . URL: http:\/\/www.springerlink.com\/content\/h80k45x24t1q7426\/","DOI":"10.1007\/s11075-006-9056-0"},{"key":"666_CR26","doi-asserted-by":"crossref","unstructured":"Lucet, Y.: What shape is your conjugate? A survey of computational convex analysis and its applications. SIAM Rev. 52(3), 505\u2013542 (2010). doi: 10.1137\/100788458","DOI":"10.1137\/100788458"},{"key":"666_CR27","unstructured":"Lucet, Y., Bauschke, H.H., Trienis, M.: The piecewise linear-quadratic model for computational convex analysis. Comput. Optim. Appl. 43, 95\u2013118 (2009). URL: http:\/\/www.springerlink.com\/content\/j726881521t4541l\/"},{"key":"666_CR28","unstructured":"Moffat, S.M.: On the Kernel Average of n Functions. Master\u2019s thesis, Department of Mathematics, University of British Columbia (2009). URL: http:\/\/hdl.handle.net\/2429\/21932"},{"key":"666_CR29","unstructured":"Moreau, J.J.: Proximit\u00e9 et dualit\u00e9 dans un espace Hilbertien. Bull. Soc. Math. France 93, 273\u2013299 (1965). URL: http:\/\/www.numdam.org\/item?id=BSMF_1965__93__273_0"},{"key":"666_CR30","unstructured":"Noullez, A., Vergassola, M.: A fast Legendre transform algorithm and applications to the adhesion model. J. Sci. Comput. 9(3), 259\u2013281 (1994). URL: http:\/\/www.springerlink.com\/content\/h8733538m6523g82"},{"key":"666_CR31","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, Berlin (1998). URL: http:\/\/www.springer.com\/math\/book\/978-3-540-62772-2"},{"key":"666_CR32","unstructured":"Scilab Consortium: Scilab (1994). URL: http:\/\/www.scilab.org"},{"key":"666_CR33","unstructured":"She, Z.S., Aurell, E., Frisch, U.: The inviscid Burgers equation with initial data of Brownian type. Commun. Math. Phys. 148(3), 623\u2013641 (1992). URL: http:\/\/projecteuclid.org\/euclid.cmp\/1104251047"},{"key":"666_CR34","doi-asserted-by":"crossref","unstructured":"Sun, J.: On the structure of convex piecewise quadratic functions. J. Optim. Theory Appl. 72(3), 499\u2013510 (1992). doi: 10.1007\/BF00939839","DOI":"10.1007\/BF00939839"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0666-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-013-0666-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0666-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:00:02Z","timestamp":1559124002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-013-0666-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,22]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["666"],"URL":"https:\/\/doi.org\/10.1007\/s10107-013-0666-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,22]]}}}