{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T07:09:25Z","timestamp":1774940965653,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,9,23]],"date-time":"2016-09-23T00:00:00Z","timestamp":1474588800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Strategiske Forskningsr\u00e5d (DK)","award":["09-067056"],"award-info":[{"award-number":["09-067056"]}]},{"name":"Teknologi og Produktion, Det Frie Forskningsr\u00e5d (DK)","award":["4005-00122"],"award-info":[{"award-number":["4005-00122"]}]},{"name":"European Research Council (BE)","award":["259166"],"award-info":[{"award-number":["259166"]}]},{"DOI":"10.13039\/100010661","name":"H2020","doi-asserted-by":"crossref","award":["642682"],"award-info":[{"award-number":["642682"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Cordis (BE)","award":["MCITN-607957"],"award-info":[{"award-number":["MCITN-607957"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10957-016-1013-z","type":"journal-article","created":{"date-parts":[[2016,9,23]],"date-time":"2016-09-23T10:33:05Z","timestamp":1474626785000},"page":"206-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Approach for Analyzing the Global Rate of Convergence of Quasi-Newton and Truncated-Newton Methods"],"prefix":"10.1007","volume":"172","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4262-0577","authenticated-orcid":false,"given":"T. L.","family":"Jensen","sequence":"first","affiliation":[]},{"given":"M.","family":"Diehl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,23]]},"reference":[{"key":"1013_CR1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. SIAM, Philadelphia (2000)"},{"key":"1013_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/9781118723203","volume-title":"Practical Methods of Optimization","author":"R Fletcher","year":"2000","unstructured":"Fletcher, R.: Practical Methods of Optimization, 2nd edn. Wiley, Hoboken (2000)","edition":"2"},{"key":"1013_CR3","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer Series in Operations Research, Berlin (2006)","edition":"2"},{"key":"1013_CR4","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1090\/S0025-5718-1967-0224273-2","volume":"21","author":"CG Broyden","year":"1967","unstructured":"Broyden, C.G.: Quasi-Newton methods and their application to function minimization. Math. Comput. 21, 368\u2013381 (1967)","journal-title":"Math. Comput."},{"issue":"6","key":"1013_CR5","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF00927440","volume":"5","author":"HY Huang","year":"1970","unstructured":"Huang, H.Y.: Unified approach to quadratically convergent algorithms for function minimization. J. Optim. Theory Appl. 5(6), 405\u2013423 (1970)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1013_CR6","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1093\/imamat\/6.3.222","volume":"6","author":"CG Broyden","year":"1970","unstructured":"Broyden, C.G.: The convergence of a class of double-rank minimization algorithms: 2. The new algorithm. IMA J. Appl. Math. 6(3), 222\u2013231 (1970)","journal-title":"IMA J. Appl. Math."},{"issue":"3","key":"1013_CR7","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R Fletcher","year":"1970","unstructured":"Fletcher, R.: A new approach to variable metric algorithms. Comput. J. 13(3), 317\u2013322 (1970)","journal-title":"Comput. J."},{"issue":"109","key":"1013_CR8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","volume":"24","author":"D Goldfarb","year":"1970","unstructured":"Goldfarb, D.: A family of variable-metric methods derived by variational means. Math. Comput. 24(109), 23\u201326 (1970)","journal-title":"Math. Comput."},{"issue":"111","key":"1013_CR9","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","volume":"24","author":"DF Shanno","year":"1970","unstructured":"Shanno, D.F.: Conditioning of quasi-Newton methods for function minimization. Math. Comput. 24(111), 647\u2013656 (1970)","journal-title":"Math. Comput."},{"issue":"4","key":"1013_CR10","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1093\/comjnl\/10.4.406","volume":"10","author":"WC Davidon","year":"1968","unstructured":"Davidon, W.C.: Variance algorithm for minimization. Comput. J. 10(4), 406\u2013410 (1968)","journal-title":"Comput. J."},{"key":"1013_CR11","volume-title":"Nonlinear Programming","author":"AV Fiacco","year":"1968","unstructured":"Fiacco, A.V., McCormick, G.P.: Nonlinear Programming. Wiley, New York (1968)"},{"key":"1013_CR12","unstructured":"Murtagh, B.A., Sargent, R.W.H.: A constrained minimization method with quadratic convergence. In: Optimization. Academic Press, London (1969)"},{"key":"1013_CR13","unstructured":"Wolfe, P.: Another variable metric method. Working paper (1968)"},{"key":"1013_CR14","doi-asserted-by":"crossref","unstructured":"Davidon, W.C.: Variable metric method for minimization. Technical report. AEC Research and Development Report, ANL-5990 (revised) (1959)","DOI":"10.2172\/4222000"},{"issue":"2","key":"1013_CR15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1093\/comjnl\/6.2.163","volume":"6","author":"R Fletcher","year":"1963","unstructured":"Fletcher, R., Powell, M.J.D.: A rapidly convergent descent method for minimization. Comput. J. 6(2), 163\u2013168 (1963)","journal-title":"Comput. J."},{"issue":"1","key":"1013_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1014857111737","volume":"113","author":"D Hull","year":"2002","unstructured":"Hull, D.: On the huang class of variable metric methods. J. Optim. Theory Appl. 113(1), 1\u20134 (2002)","journal-title":"J. Optim. Theory Appl."},{"key":"1013_CR17","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"5","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comput. 5, 773\u2013782 (1980)","journal-title":"Math. Comput."},{"key":"1013_CR18","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited-memory BFGS method for large scale optimization. Math. Program. 45, 503\u2013528 (1989)","journal-title":"Math. Program."},{"issue":"4","key":"1013_CR19","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF00937366","volume":"2","author":"GE Meyer","year":"1968","unstructured":"Meyer, G.E.: Properties of the conjugate gradient and Davidon methods. J. Optim. Theory Appl. 2(4), 209\u2013219 (1968)","journal-title":"J. Optim. Theory Appl."},{"key":"1013_CR20","volume-title":"Computational Method in Optimization","author":"E Polak","year":"1971","unstructured":"Polak, E.: Computational Method in Optimization. Academic Press, Cambridge (1971)"},{"key":"1013_CR21","unstructured":"Ben-Tal, A., Nemirovski, A.: Lecture notes: optimization iii: Convex analysis, nonlinear programming theory, nonlinear programming algorithms. Georgia Institute of Technology, H. Milton Stewart School of Industrial and System Engineering. http:\/\/www2.isye.gatech.edu\/~nemirovs\/OPTIII_LectureNotes.pdf (2013)"},{"issue":"3","key":"1013_CR22","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/moor.3.3.244","volume":"3","author":"DF Shanno","year":"1978","unstructured":"Shanno, D.F.: Conjugate gradient methods with inexact searches. Math. Oper. Res. 3(3), 244\u2013256 (1978)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1013_CR23","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF01584554","volume":"2","author":"LCW Dixon","year":"1972","unstructured":"Dixon, L.C.W.: Quasi-newton algorithms generate identical points. Math. Program. 2(1), 383\u2013387 (1972)","journal-title":"Math. Program."},{"key":"1013_CR24","unstructured":"Nocedal, J.: Finding the middle ground between first and second-order methods. OPTIMA 79\u2014 Mathematical Programming Society Newsletter, discussion column (2009)"},{"key":"1013_CR25","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"AS Nemirovskii","year":"1983","unstructured":"Nemirovskii, A.S., Yudin, D.B.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983). First published in Russian (1979)"},{"key":"1013_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization, A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization, A Basic Course. Kluwer Academic Publishers, Berlin (2004)"},{"key":"1013_CR27","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for unconstrained convex minimization problem with the rate of convergence $$O({1}\/{k^2})$$ O ( 1 \/ k 2 ) . Dokl. AN SSSR (translated as Soviet Math. Docl.) 269, 543\u2013547 (1983)","journal-title":"Dokl. AN SSSR (translated as Soviet Math. Docl.)"},{"key":"1013_CR28","first-page":"509","volume":"24","author":"Y Nesterov","year":"1988","unstructured":"Nesterov, Y.: On an approach to the construction of optimal methods of minimization of smooth convex functions. Ekonom. i. Mat. Mettody 24, 509\u2013517 (1988)","journal-title":"Ekonom. i. Mat. Mettody"},{"key":"1013_CR29","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of nonsmooth functions. Math. Program. Ser. A 103, 127\u2013152 (2005)","journal-title":"Math. Program. Ser. A"},{"key":"1013_CR30","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite objective function. Universit\u00e9 Catholique de Louvain, Center for Operations Research and Econometrics (CORE). No 2007076, CORE discussion papers (2007)"},{"issue":"12","key":"1013_CR31","doi-asserted-by":"crossref","first-page":"2992","DOI":"10.1109\/TIP.2007.909319","volume":"16","author":"JM Bioucas-Dias","year":"2007","unstructured":"Bioucas-Dias, J.M., Figueiredo, M.A.T.: A new TwIST: two-step iterative shrinkage\/thresholding algorithms for image restoration. IEEE Trans. Image Process. 16(12), 2992\u20133004 (2007)","journal-title":"IEEE Trans. Image Process."},{"key":"1013_CR32","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"1013_CR33","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. unpublished manuscript (2008)"},{"key":"1013_CR34","volume-title":"A Collection of Matrices for Testing Computational Algorithms","author":"RT Gregory","year":"1969","unstructured":"Gregory, R.T., Karney, D.L.: A Collection of Matrices for Testing Computational Algorithms. Wiley, New York (1969)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-016-1013-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-016-1013-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-016-1013-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T19:30:12Z","timestamp":1568403012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-016-1013-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,23]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["1013"],"URL":"https:\/\/doi.org\/10.1007\/s10957-016-1013-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,23]]}}}