{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T09:46:41Z","timestamp":1763977601020},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2006,3]]},"abstract":"Convex optimization deals with certain classes of mathematical optimization problems including least-squares and linear programming problems. This area has recently been the focus of considerable study and interest due to the facts that convex optimization problems can be solved efficiently by interior-point methods and that convex optimization problems are actually much more prevalent in practice that previously thought.Key notions in convex optimization are the Fenchel conjugate and the subdifferential of a convex function. In this paper, we build a new bridge between convex optimization and symbolic mathematics by describing the Maple package fenchel, which allows for the symbolic computation of these objects for numerous convex functions defined on the real line. We are able to symbolically reproduce computations for finding Fenchel conjugates and subdifferentials for numerous nontrivial examples found in the literature.<\/jats:p>","DOI":"10.1145\/1151446.1151453","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"18-28","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Symbolic computation of Fenchel conjugates"],"prefix":"10.1145","volume":"40","author":[{"given":"Heinz H.","family":"Bauschke","sequence":"first","affiliation":[{"name":"Irving K. Barber School, UBC Okanagan, Canada"}]},{"given":"Martin v.","family":"Mohrenschildt","sequence":"additional","affiliation":[{"name":"McMaster University, Hamilton, Ontario, Canada"}]}],"member":"320","published-online":{"date-parts":[[2006,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008607511915"},{"issue":"1","key":"e_1_2_1_2_1","first-page":"27","article-title":"Legendre functions and the method of random Bregman projections","volume":"4","author":"Bauschke H. H.","year":"1997","journal-title":"Journal of Convex Analysis"},{"key":"e_1_2_1_3_1","volume-title":"Department of Combinatorics and Optimization","author":"Bauschke H. H.","year":"1997"},{"key":"e_1_2_1_4_1","unstructured":"D. P. Bertsekas. Nonlinear Programming. Athena Scientific 1995. D. P. Bertsekas. Nonlinear Programming . Athena Scientific 1995."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-9859-3"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/993483"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02124750"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940283"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"J.-B.\n \n Hiriart-Urruty\n and \n \n \n C.\n \n Lemar\u00e9chal\n \n \n . \n Convex Analysis and Minimization Algorithms I volume \n 305\n of \n Grundlehren der mathematischen Wissenschaften\n . \n Springer-Verlag 1993\n . J.-B. Hiriart-Urruty and C. Lemar\u00e9chal. Convex Analysis and Minimization Algorithms I volume 305 of Grundlehren der mathematischen Wissenschaften . Springer-Verlag 1993.","DOI":"10.1007\/978-3-662-02796-7"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"J.-B.\n \n Hiriart-Urruty\n and \n \n \n C.\n \n Lemar\u00e9chal\n \n \n . \n Convex Analysis and Minimization Algorithms II volume \n 306\n of \n Grundlehren der mathematischen Wissenschaften\n . \n Springer-Verlag 1993\n . J.-B. Hiriart-Urruty and C. Lemar\u00e9chal. Convex Analysis and Minimization Algorithms II volume 306 of Grundlehren der mathematischen Wissenschaften . Springer-Verlag 1993.","DOI":"10.1007\/978-3-662-02796-7"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1985.11971528"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005779"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00248008"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-1043-5"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02614440"},{"key":"e_1_2_1_16_1","volume-title":"Academic Press","author":"Roberts A. W.","year":"1973"},{"key":"e_1_2_1_17_1","unstructured":"R. T. Rockafellar. Convex Analysis. Princeton University Press Princeton NJ 1970. R. T. Rockafellar. Convex Analysis . Princeton University Press Princeton NJ 1970."},{"issue":"3","key":"e_1_2_1_18_1","first-page":"33","article-title":"Using \"piecewise\" to solve classes of control theory problems","volume":"4","author":"Mohrenschildt M. v.","year":"1997","journal-title":"MapleTech"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1998.0229"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1151446.1151453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T18:25:37Z","timestamp":1672251937000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1151446.1151453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["10.1145\/1151446.1151453"],"URL":"https:\/\/doi.org\/10.1145\/1151446.1151453","relation":{},"ISSN":["1932-2240"],"issn-type":[{"value":"1932-2240","type":"print"}],"subject":[],"published":{"date-parts":[[2006,3]]},"assertion":[{"value":"2006-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}