{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:46:03Z","timestamp":1760028363997,"version":"3.37.3"},"reference-count":32,"publisher":"Informa UK Limited","issue":"3","funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-0915220","DMS-1318480"],"award-info":[{"award-number":["DMS-0915220","DMS-1318480"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2024,5,3]]},"DOI":"10.1080\/10556788.2023.2241769","type":"journal-article","created":{"date-parts":[[2023,8,18]],"date-time":"2023-08-18T14:13:33Z","timestamp":1692368013000},"page":"459-488","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":3,"title":["A class of projected-search methods for bound-constrained optimization"],"prefix":"10.1080","volume":"39","author":[{"given":"Michael W.","family":"Ferry","sequence":"first","affiliation":[{"name":"NVIDIA Corporation, Hillsboro, Oregon, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip E.","family":"Gill","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of California, San Diego, La Jolla, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elizabeth","family":"Wong","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of California, San Diego, La Jolla, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minxin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of California, San Diego, La Jolla, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2023,8,18]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1966.16.1"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1976.1101194"},{"key":"e_1_3_3_4_1","series-title":"Computer Science and Applied Mathematics","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"Bertsekas D.P.","year":"1982","unstructured":"D.P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Computer Science and Applied Mathematics, Academic Press Inc. [Harcourt Brace Jovanovich Publishers], New York, 1982."},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0320018"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/200979.201043"},{"key":"e_1_3_3_7_1","series-title":"Prentice-Hall Series in Automatic Computation","volume-title":"Algorithms for Minimization Without Derivatives","author":"Brent R.P.","year":"1973","unstructured":"R.P. Brent, Algorithms for Minimization Without Derivatives, Prentice-Hall Series in Automatic Computation, Prentice-Hall Inc., Englewood Cliffs, N.J., 1973."},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0916069"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592073"},{"key":"e_1_3_3_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971200"},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100263"},{"key":"e_1_3_3_12_1","unstructured":"M.W. Ferry Projected-Search Methods for Box-Constrained Optimization Ph.D. thesis Department of Mathematics University of California San Diego May 2011."},{"key":"e_1_3_3_13_1","volume-title":"A Limited-Memory Reduced-Hessian Method for Bound-Constrained Optimization","author":"Ferry M.W.","year":"2020","unstructured":"M.W. Ferry, P.E. Gill, E. Wong, and M. Zhang, A Limited-Memory Reduced-Hessian Method for Bound-Constrained Optimization, Center for Computational Mathematics Report CCoM 20-05, Center for Computational Mathematics, University of California, San Diego, La Jolla, CA, 2020."},{"key":"e_1_3_3_14_1","volume-title":"Projected-Search Methods for Bound-Constrained Optimization","author":"Ferry M.W.","year":"2020","unstructured":"M.W. Ferry, P.E. Gill, E. Wong, and M. Zhang, Projected-Search Methods for Bound-Constrained Optimization, Center for Computational Mathematics Report CCoM 20-01, Center for Computational Mathematics, University of California, San Diego, La Jolla, CA, 2020."},{"key":"e_1_3_3_15_1","volume-title":"Supplementary Numerical Results for Projected-Search Methods for Bound-Constrained Optimization","author":"Ferry M.W.","year":"2020","unstructured":"M.W. Ferry, P.E. Gill, E. Wong, and M. Zhang, Supplementary Numerical Results for Projected-Search Methods for Bound-Constrained Optimization, Center for Computational Mathematics Report CCoM 20-08, Center for Computational Mathematics, University of California, San Diego, La Jolla, CA, 2020."},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(90)90237-E"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01583799"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1964-11178-2"},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/962437.962439"},{"key":"e_1_3_3_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(89)90177-6"},{"key":"e_1_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/08073812X"},{"key":"e_1_3_3_22_1","volume-title":"The Art of Computer Programming","author":"Knuth D.","year":"1997","unstructured":"D. Knuth, The Art of Computer Programming, 3rd ed., Addison-Wesley Publishing Company, Redwood City, 1997.","edition":"3"},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(66)90114-5"},{"key":"e_1_3_3_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049669"},{"key":"e_1_3_3_25_1","unstructured":"J.J. Mor\u00e9 and D.C. Sorensen Newton's method in Studies in Mathematics Volume 24. MAA Studies in Numerical Analysis G. H. Golub ed. Math. Assoc. America Washington DC 1984 pp. 29\u201382."},{"key":"e_1_3_3_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/192115.192132"},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-97-00866-1"},{"key":"e_1_3_3_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/b98874"},{"key":"e_1_3_3_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719468"},{"key":"e_1_3_3_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/512274.512284"},{"key":"e_1_3_3_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1011036"},{"key":"e_1_3_3_32_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.164.0407"},{"key":"e_1_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/279232.279236"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2023.2241769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T12:53:56Z","timestamp":1730379236000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2023.2241769"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,18]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5,3]]}},"alternative-id":["10.1080\/10556788.2023.2241769"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2023.2241769","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2023,8,18]]},"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"},{"value":"2022-10-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-23","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-08-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}