{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T04:10:04Z","timestamp":1752379804577,"version":"3.41.2"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1023\/a:1011212022308","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T04:18:21Z","timestamp":1040617101000},"page":"297-317","source":"Crossref","is-referenced-by-count":0,"title":["A Study of the Dennis-Wolkowicz Method on Convex Functions"],"prefix":"10.1007","volume":"19","author":[{"given":"Guanghui","family":"Liu","sequence":"first","affiliation":[]},{"given":"Lixing","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"335911_CR1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1080\/10556789208805528","volume":"1","author":"M. Al-Baali","year":"1992","unstructured":"M. Al-Baali, \u201cHighly efficient Broyden methods of minimization with variable parameter, \u201d Optimization Methods and Software, vol. 1, pp. 301\u2013310, 1992.","journal-title":"Optimization Methods and Software"},{"key":"335911_CR2","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1137\/0802026","volume":"2","author":"R.H. Byrd","year":"1992","unstructured":"R.H. Byrd, D.C. Liu, and J. Nocedal, \u201cOn the behavior of Broyden's class of quasi-Newton methods, \u201d SIAM J. Opt., vol. 2, pp. 533\u2013557, 1992.","journal-title":"SIAM J. Opt."},{"key":"335911_CR3","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1137\/0726042","volume":"26","author":"R.H. Byrd","year":"1989","unstructured":"R.H. Byrd and J. Nocedal, \u201cA tool for the analysis of quasi-Newton methods with application to unconstrained minimization, \u201d SIAM J. Numer. Anal., vol. 26, pp. 727\u2013739, 1989.","journal-title":"SIAM J. Numer. Anal."},{"key":"335911_CR4","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1137\/0724077","volume":"24","author":"R.H. Byrd","year":"1987","unstructured":"R.H. Byrd, J. Nocedal, and Y. Yuan, \u201cGlobal convergence of a class of quasi-Newton methods on convex problems, \u201d SIAM J. Numer. Anal., vol. 24, pp. 1171\u20131191, 1987.","journal-title":"SIAM J. Numer. Anal."},{"key":"335911_CR5","doi-asserted-by":"crossref","unstructured":"R.H. Byrd, J. Nocedal, and C. Zhu, \u201cTowards a discrete Newton method with memory for large-scale optimization, \u201d Technical Report OTC 95\/01, 1996.","DOI":"10.1007\/978-1-4899-0289-4_1"},{"key":"335911_CR6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01594934","volume":"2","author":"A.R. Conn","year":"1991","unstructured":"A.R. Conn, N.I.M. Gould, and Ph. L. Toint, \u201cConvergence of quasi-Newton matrices generated by the symmetric rank one update, \u201d Math. Prog., vol. 2, pp. 177\u2013195, 1991.","journal-title":"Math. Prog."},{"key":"335911_CR7","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF00940702","volume":"78","author":"M. Contreras","year":"1993","unstructured":"M. Contreras and R.A. Tapia, \u201cSizing the BFGS and DFP updates: Numerical study, \u201d JOTA, vol. 78, pp. 93\u2013108, 1993.","journal-title":"JOTA"},{"key":"335911_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01681328","volume":"9","author":"W.C. Davidon","year":"1975","unstructured":"W.C. Davidon, \u201cOptimally conditioned optimization algorithms without line searches, \u201d Math. Prog, vol. 9, pp. 1\u201330, 1975.","journal-title":"Math. Prog"},{"key":"335911_CR9","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1145\/355958.355965","volume":"7","author":"J.E. Dennis Jr.","year":"1981","unstructured":"J.E. Dennis Jr., D.M. Gay, and R.E. Welsch, \u201cAn adaptive nonlinear least-squares algorithm, \u201d TOMS, vol. 7, pp. 348\u2013368, 1981.","journal-title":"TOMS"},{"key":"335911_CR10","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"J.E. Dennis Jr.","year":"1983","unstructured":"J.E. Dennis Jr. and R.B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall: Englewood Cliffs, NJ, 1983 (in English). Mir Publishing Office, Moscow, 1988 (in Russian)."},{"key":"335911_CR11","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1137\/0730067","volume":"30","author":"J.E. Dennis Jr.","year":"1993","unstructured":"J.E. Dennis Jr. and H. Wolkowicz, \u201cSizing and least-change secant methods, \u201d SIAM J. Numer. Anal., vol. 30, pp. 1291\u20131314, 1993.","journal-title":"SIAM J. Numer. Anal."},{"key":"335911_CR12","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1137\/0801002","volume":"1","author":"R. Fletcher","year":"1991","unstructured":"R. Fletcher, \u201cA new variational result for quasi-Newton formulae, \u201d SIAM J. Opt., vol. 1, pp. 18\u201321, 1991.","journal-title":"SIAM J. Opt."},{"key":"335911_CR13","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"R. Fletcher, Practical Methods of Optimization, 2nd ed., John Wiley and Sons: New York, 1987.","edition":"2nd ed."},{"key":"335911_CR14","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"J.C. Gilbert","year":"1992","unstructured":"J.C. Gilbert and J. Nocedal, \u201cGlobal convergence properties of conjugate gradient methods for optimization, \u201d SIAM J. Optimization, vol. 2, pp. 21\u201342, 1992.","journal-title":"SIAM J. Optimization"},{"key":"335911_CR15","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1137\/S1052623495280378","volume":"8","author":"L.X. Han","year":"1998","unstructured":"L.X. Han and G.H. Liu, \u201cGlobal analysis of the Dennis-Wolkowicz least-change secant algorithm, \u201d SIAM J. Opt., vol. 8, pp. 813\u2013832, 1998.","journal-title":"SIAM J. Opt."},{"key":"335911_CR16","series-title":"Technical Report","doi-asserted-by":"crossref","DOI":"10.21236\/ADA233965","volume-title":"A theoretical and experimental study of the symmetric rank one update","author":"H. Khalfan","year":"1990","unstructured":"H. Khalfan, R.H. Byrd, and R.B. Schnabel, \u201cA theoretical and experimental study of the symmetric rank one update, \u201d University of Colorado, Boulder, Technical Report CU-CS-489-90, 1990."},{"key":"335911_CR17","unstructured":"D. Li and M. Fukushima, \u201cOn the global convergence of BFGS method for nonconvex unconstrained optimization problems, \u201d Department of Applied Mathematics and Physics, Kyoto University, Technical Report 99007, 1999."},{"key":"335911_CR18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02191760","volume":"83","author":"L. Luksan","year":"1994","unstructured":"L. Luksan, \u201cComputational experience with known variable metric updates, \u201d JOTA, vol. 83, pp. 27\u201347, 1994.","journal-title":"JOTA"},{"key":"335911_CR19","first-page":"199","volume-title":"Acta Numerica","author":"J. Nocedal","year":"1992","unstructured":"J. Nocedal, \u201cTheory of algorithms for unconstrained optimization, \u201d in Acta Numerica, A. Iserles, (Ed.), Cambridge University Press: Cambridge, England, 1992, pp. 199\u2013242."},{"key":"335911_CR20","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1287\/mnsc.20.5.845","volume":"20","author":"S.S. Oren","year":"1974","unstructured":"S.S. Oren and D.G. Luenberger, \u201cSelf-scaling veriable metric (SSVM)algorithms, Part I. Criteria and sufficient conditions for scaling a class of algorithms, \u201d Management Sci., vol. 20, pp. 845\u2013862, 1974.","journal-title":"Management Sci."},{"key":"335911_CR21","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/BF01580654","volume":"10","author":"S.S. Oren","year":"1976","unstructured":"S.S. Oren and E. Spedicato, \u201cOptimal conditioning of self-scaling variable metric algorithms, \u201d Math. Prog., vol. 10, pp. 70\u201390, 1976.","journal-title":"Math. Prog."},{"key":"335911_CR22","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1093\/comjnl\/12.2.171","volume":"12","author":"J.D. Pearson","year":"1969","unstructured":"J.D. Pearson, \u201cVariable metric methods of minimization, \u201d The Computer J., vol. 12, pp. 171\u2013178, 1969.","journal-title":"The Computer J."},{"key":"335911_CR23","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/BF00933517","volume":"25","author":"K.H. Phua","year":"1978","unstructured":"K.H. Phua and D.F. Shanno, \u201cNumerical comparison of several variable metric algorithms, \u201d JOTA, vol. 25, pp. 507\u2013518, 1978.","journal-title":"JOTA"},{"key":"335911_CR24","volume-title":"Numerical Methods for Nonlinear Optimization","author":"M.J.D. Powell","year":"1972","unstructured":"M.J.D. Powell, \u201cSome properties of the variable metric algorithm, \u201d in Numerical Methods for Nonlinear Optimization, F.A. Lootsma, (Ed.), Academia Press: London, 1972."},{"key":"335911_CR25","volume-title":"SIAM-AMS Proceedings","author":"M.J.D. Powell","year":"1976","unstructured":"M.J.D. Powell, \u201cSome global convergence properties of a variable metric algorithm for minimization without exact line searches in Nonlinear Programming, \u201d in SIAM-AMS Proceedings, 1976, vol. IX., R.W. Cottle and C.E. Lemke (Eds.), American Mathematical Society: Providence, RI."},{"key":"335911_CR26","first-page":"366","volume":"12","author":"D. Pu","year":"1994","unstructured":"D. Pu and W. Tian, \u201cA class of modified Broyden algorithms, \u201d J. of Computational Mathematics, vol. 12, pp. 366\u2013379, 1994.","journal-title":"J. of Computational Mathematics"},{"key":"335911_CR27","unstructured":"J.Werner, \u201cGlobal convergence of quasi-Newton methods with practical line searches, \u201d NAM-Bericht Nr. 67, Marz, Technical Report, 1989."},{"key":"335911_CR28","series-title":"Tech. Report","volume-title":"Department of Combinatorics and Optimization","author":"H. Wolkowicz","year":"1990","unstructured":"H. Wolkowicz, \u201cMeasures for symmetric rank-one updates, \u201d Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Tech. Report CORR 90-03, 1990."},{"key":"335911_CR29","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1093\/imanum\/8.4.487","volume":"8","author":"Y. Zhang","year":"1988","unstructured":"Y. Zhang and R.P. Tewarson, \u201cQuasi-Newton algorithms with updates from the pre-convex part of Broyden's family, \u201d IMA J. Numer. Anal., vol. 8, pp. 487\u2013509, 1988.","journal-title":"IMA J. Numer. Anal."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011212022308.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011212022308\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011212022308.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:34:16Z","timestamp":1752377656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011212022308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["335911"],"URL":"https:\/\/doi.org\/10.1023\/a:1011212022308","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}