{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T05:56:54Z","timestamp":1778133414968,"version":"3.51.4"},"reference-count":17,"publisher":"Informa UK Limited","issue":"4-6","funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006227","name":"Lawrence Livermore National Laboratory","doi-asserted-by":"publisher","award":["DE-AC52-07NA27344"],"award-info":[{"award-number":["DE-AC52-07NA27344"]}],"id":[{"id":"10.13039\/100006227","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006224","name":"Argonne National Laboratory","doi-asserted-by":"crossref","award":["DE-AC02-06CH11357"],"award-info":[{"award-number":["DE-AC02-06CH11357"]}],"id":[{"id":"10.13039\/100006224","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2018,11,2]]},"DOI":"10.1080\/10556788.2018.1480625","type":"journal-article","created":{"date-parts":[[2018,9,12]],"date-time":"2018-09-12T04:16:15Z","timestamp":1536725775000},"page":"1010-1029","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":5,"title":["On efficient Hessian computation using the edge pushing algorithm in Julia"],"prefix":"10.1080","volume":"33","author":[{"given":"C. G.","family":"Petra","sequence":"first","affiliation":[{"name":"Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA, USA"}]},{"given":"F.","family":"Qiang","sequence":"additional","affiliation":[{"name":"Mathematics and Computer Science Division, Argonne National Laboratory, Lemont, IL, USA"}]},{"given":"M.","family":"Lubin","sequence":"additional","affiliation":[{"name":"Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, USA"}]},{"given":"J.","family":"Huchette","sequence":"additional","affiliation":[{"name":"Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, USA"}]}],"member":"301","published-online":{"date-parts":[[2018,9,12]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1137\/15M1020575"},{"key":"CIT0005","volume-title":"Automatically finding and exploiting partially separable structure in nonlinear programming problems","author":"Gay D.M.","year":"1996"},{"key":"CIT0006","first-page":"173","author":"Gay D.M.","year":"1996","journal-title":"Comput. Diff."},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144504444711"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1137\/050639879"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1080.0286"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1145\/2513109.2513110"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2011.580098"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1145\/2490254"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407874"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1007\/BF01399316"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717761"},{"key":"CIT0017","first-page":"841","volume":"14","author":"Jordan A.","year":"2002","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"CIT0018","volume-title":"Numerical Optimization","author":"Nocedal J.","year":"2006","edition":"2"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-016-0100-3"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2018.1480625","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,8]],"date-time":"2018-10-08T06:36:47Z","timestamp":1538980607000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2018.1480625"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,12]]},"references-count":17,"journal-issue":{"issue":"4-6","published-online":{"date-parts":[[2018,5,18]]},"published-print":{"date-parts":[[2018,11,2]]}},"alternative-id":["10.1080\/10556788.2018.1480625"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2018.1480625","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,12]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"}]}}