{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T20:25:35Z","timestamp":1779308735274,"version":"3.51.4"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,5,15]],"date-time":"2008-05-15T00:00:00Z","timestamp":1210809600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s11075-008-9198-3","type":"journal-article","created":{"date-parts":[[2008,5,14]],"date-time":"2008-05-14T08:49:06Z","timestamp":1210754946000},"page":"279-300","source":"Crossref","is-referenced-by-count":13,"title":["A projected Newton-CG method for nonnegative astronomical image deblurring"],"prefix":"10.1007","volume":"48","author":[{"given":"G.","family":"Landi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Loli Piccolomini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,15]]},"reference":[{"key":"9198_CR1","doi-asserted-by":"crossref","first-page":"1326","DOI":"10.1137\/S1064827502410451","volume":"25","author":"J.M. Bardsley","year":"2003","unstructured":"Bardsley, J.M., Vogel, C.R.: A nonnegatively constrained convex programming method for image reconstruction. SIAM J. Sci. Comput. 25, 1326\u20131343 (2003)","journal-title":"SIAM J. Sci. Comput."},{"key":"9198_CR2","doi-asserted-by":"crossref","DOI":"10.1887\/0750304359","volume-title":"Introduction to Inverse Problems in Imaging","author":"M. Bertero","year":"1998","unstructured":"Bertero, M., Boccacci, P.: Introduction to Inverse Problems in Imaging. IOP, Bristol (1998)"},{"issue":"2","key":"9198_CR3","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0320018","volume":"20","author":"D. Bertsekas","year":"1982","unstructured":"Bertsekas, D.: Projected Newton methods for optimization problem with simple constraints. SIAM J. Control Optim. 20(2), 221\u2013245 (1982)","journal-title":"SIAM J. Control Optim."},{"key":"9198_CR4","volume-title":"Nonlinear Programming","author":"D. Bertsekas","year":"1999","unstructured":"Bertsekas, D.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"key":"9198_CR5","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1086\/111605","volume":"79","author":"L.B. Lucy","year":"1974","unstructured":"Lucy, L.B.: An iterative technique for the rectification of observed images. Astron. J. 79, 745\u2013754 (1974)","journal-title":"Astron. J."},{"key":"9198_CR6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1137\/0801008","volume":"1","author":"J.J. Mor\u00e8","year":"1991","unstructured":"Mor\u00e8, J.J., Toraldo, G.: On the solution of large quadaratic programming problems with bound constraints. SIAM J. Opt. 1, 93\u2013113 (1991)","journal-title":"SIAM J. Opt."},{"key":"9198_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999)"},{"key":"9198_CR8","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0024-3795(80)90173-1","volume":"34","author":"D.P. O\u2019Leary","year":"1980","unstructured":"O\u2019Leary, D.P.: A generalized conjugate gradient algorithm for solving a class of quadratic programming problems. Linear Alg. Appl. 34, 371\u2013399 (1980)","journal-title":"Linear Alg. Appl."},{"issue":"3","key":"9198_CR9","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T. Steihaug","year":"1983","unstructured":"Steihaug, T.: The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20(3), 626\u2013637 (1983)","journal-title":"SIAM J. Numer. Anal."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-008-9198-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-008-9198-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-008-9198-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:08:11Z","timestamp":1559351291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-008-9198-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,15]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["9198"],"URL":"https:\/\/doi.org\/10.1007\/s11075-008-9198-3","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,15]]}}}