{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:02Z","timestamp":1752378002105,"version":"3.41.2"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"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":[[1997,11]]},"DOI":"10.1023\/a:1008645321602","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"219-244","source":"Crossref","is-referenced-by-count":1,"title":["Metric-Based Symmetric Rank-One Updates"],"prefix":"10.1007","volume":"8","author":[{"given":"B.","family":"Smith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.L.","family":"Nazareth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"X","key":"140552_CR1","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1007\/BF02731630","volume":"5","author":"H.L. Anderson","year":"1957","unstructured":"H.L. Anderson and W.C. Davidon, \"Machine analysis of pion scattering by the maximum likelihood method,\" Il Nuovo Cimento, Serie X, vol. 5, pp. 1238\u20131255, 1957.","journal-title":"Il Nuovo Cimento"},{"key":"140552_CR2","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/BF00934451","volume":"29","author":"R.K. Brayton","year":"1979","unstructured":"R.K. Brayton and J. Cullum, \"An algorithm for minimizing a differentiable function subject to box constraints and errors,\" J.O.T.A., vol. 29, pp. 521\u2013558, 1979.","journal-title":"J.O.T.A."},{"key":"140552_CR3","doi-asserted-by":"crossref","unstructured":"C.G. Broyden, \"Quasi-Newton methods and their application to function minimization,\" Mathematics of Computation, pp. 368\u2013381, 1967.","DOI":"10.1090\/S0025-5718-1967-0224273-2"},{"key":"140552_CR4","unstructured":"R.H. Byrd, \"A multiobjective characterization of the Broyden class,\" presented at ORSA\/TIMS, New York, 1990."},{"key":"140552_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01594934","volume":"50","author":"A.R. Conn","year":"1991","unstructured":"A.R. Conn, N.I.M. Gould, and Ph.L. Toint, \"Convergence of quasi-Newton matrices generated by the symmetric rank one update,\" Mathematical Programing, vol. 50, pp. 177\u2013195, 1991.","journal-title":"Mathematical Programing"},{"key":"140552_CR6","series-title":"Research and Development Report","volume-title":"Variable metric methods for minimization","author":"W.C. Davidon","year":"1959","unstructured":"W.C. Davidon, \"Variable metric methods for minimization,\" Research and Development Report ANL-5990 (Rev.), Argonne National Laboratory, Argonne, Illinois, 1959. (Reprinted in SIAM J. Optimization, vol. 1, 1991.)"},{"key":"140552_CR7","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1093\/comjnl\/10.4.406","volume":"10","author":"W.C. Davidon","year":"1968","unstructured":"W.C. Davidon, \"Variance algorithm for minimization,\" Computer Journal, vol. 10, pp. 406\u2013410, 1968.","journal-title":"Computer Journal"},{"key":"140552_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01681328","volume":"9","author":"W.C. Davidon","year":"1975","unstructured":"W.C. Davidon, \"Optimally conditioned optimization algorithms without line searches,\" Mathematical Programming, vol. 9, pp. 1\u201330, 1975.","journal-title":"Mathematical Programming"},{"key":"140552_CR9","first-page":"3","volume":"32","author":"W.C. Davidon","year":"1991","unstructured":"W.C. Davidon, R.B. Mifflin, and J.L. Nazareth, \"Some comments on notation for quasi-Newton methods,\" Optima, vol. 32, pp. 3\u20134, 1991.","journal-title":"Optima"},{"key":"140552_CR10","series-title":"Report","volume-title":"CORR","author":"J.E. Dennis","year":"1990","unstructured":"J.E. Dennis and H. Wolkowicz, \"Sizing and least change secant updates,\" CORR Report 90-02, Department of Combinatorics and Optimization, University of Waterloo, Ontario, Canada, 1990."},{"key":"140552_CR11","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"A.V. Fiacco and G.P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley: N.Y., 1968."},{"key":"140552_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0803001","volume":"3","author":"H. Khalfan","year":"1993","unstructured":"H. Khalfan, R.H. Byrd, and R.B. Schnabel, \"A theoretical and experimental study of the symmetric rank one update,\" SIAM J. Optimization, vol. 3, pp. 1\u201324, 1993.","journal-title":"SIAM J. Optimization"},{"key":"140552_CR13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01581698","volume":"65","author":"R.B. Mifflin","year":"1994","unstructured":"R.B. Mifflin and J.L. Nazareth, \"The least prior deviation quasi-Newton update,\" Mathematical Programming, vol. 65, pp. 247\u2013261, 1994.","journal-title":"Mathematical Programming"},{"key":"140552_CR14","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"J.J. Mor\u00e9","year":"1981","unstructured":"J.J. Mor\u00e9, B.S. Garbow, and K.E. Hillstrom, \"Testing unconstrained optimization software,\" ACM Trans. on Mathematical Software, vol. 7, pp. 17\u201341, 1981.","journal-title":"ACM Trans. on Mathematical Software"},{"key":"140552_CR15","volume-title":"On linesearch algorithms with guaranteed sufficient decrease","author":"J.J. Mor\u00e9","year":"1990","unstructured":"J.J. Mor\u00e9 and D.J. Thuente, \"On linesearch algorithms with guaranteed sufficient decrease,\" MCS-P153-0590, Argonne National Laboratory, Argonne, IL, 1990."},{"key":"140552_CR16","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02591801","volume":"30","author":"J.L. Nazareth","year":"1984","unstructured":"J.L. Nazareth, \"An alternative variational principle for variable metric updating,\" Mathematical Programming, vol. 30, pp. 99\u2013104, 1984.","journal-title":"Mathematical Programming"},{"key":"140552_CR17","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1137\/1036053","volume":"36","author":"J.L. Nazareth","year":"1994","unstructured":"J.L. Nazareth, \"The Newton and Cauchy perspectives on computational nonlinear optimization,\" SIAM Review, vol. 36, pp. 215\u2013225, 1994.","journal-title":"SIAM Review"},{"key":"140552_CR18","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1017\/S0962492900002270","volume":"1","author":"J. Nocedal","year":"1991","unstructured":"J. Nocedal, \"Theory of algorithms for unconstrained optimization,\" Acta Numerica, vol. 1, pp. 199\u2013242, 1991.","journal-title":"Acta Numerica"},{"key":"140552_CR19","series-title":"Report","volume-title":"A new approach to the Symmetric-Rank-One updating algorithm","author":"M.R. Osborne","year":"1988","unstructured":"M.R. Osborne and L.P. Sun, \"A new approach to the Symmetric-Rank-One updating algorithm,\" Report NMO\/01, Department of Statistics, Australian National University, Canberra, Australia, 1988."},{"key":"140552_CR20","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, \"Variable metric methods of minimization,\" Computer Journal, vol. 12, pp. 171\u2013178, 1969.","journal-title":"Computer Journal"},{"key":"140552_CR21","volume-title":"Metric and model based line search symmetric rank one updates","author":"B. Smith","year":"1995","unstructured":"B. Smith, \"Metric and model based line search symmetric rank one updates,\" Ph.D. Thesis, Department of Pure and Applied Mathematics, Washington State University, 1995."},{"key":"140552_CR22","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P. Wolfe","year":"1969","unstructured":"P. Wolfe, \"Convergence conditions for ascent methods,\" SIAM Review, vol. 11, pp. 226\u20132235, 1969.","journal-title":"SIAM Review"},{"key":"140552_CR23","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1137\/1013035","volume":"13","author":"P. Wolfe","year":"1971","unstructured":"P. Wolfe, \"Convergence conditions for ascent methods II: Some corrections,\"SIAM Review, vol. 13, pp. 185\u2013188, 1971.","journal-title":"SIAM Review"},{"key":"140552_CR24","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1287\/moor.19.4.815","volume":"19","author":"H. Wolkowicz","year":"1994","unstructured":"H. Wolkowicz, \"Measures for symmetric rank-one updates,\" Mathematics of Operations Research, vol. 19, pp. 815\u2013830, 1994.","journal-title":"Mathematics of Operations Research"},{"key":"140552_CR25","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1137\/0805009","volume":"5","author":"H. Wolkowicz","year":"1995","unstructured":"H. Wolkowicz and Q. Zhao, \"An all-inclusive efficient region of updates for least change secant methods,\" SIAM J. Optimization, vol. 5, pp. 171\u2013191, 1995.","journal-title":"SIAM J. Optimization"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008645321602.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008645321602\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008645321602.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:04:19Z","timestamp":1752375859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008645321602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["140552"],"URL":"https:\/\/doi.org\/10.1023\/a:1008645321602","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}