乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:23:18Z","timestamp":1709810598752},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T00:00:00Z","timestamp":1625788800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T00:00:00Z","timestamp":1625788800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100006132","name":"Office of Science","doi-asserted-by":"publisher","award":["DE-AC02-06CH11347","DE-AC02-06CH11347"],"id":[{"id":"10.13039\/100006132","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006132","name":"Office of Science","doi-asserted-by":"publisher","award":["DE-AC02-06CH11347"],"id":[{"id":"10.13039\/100006132","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s10589-021-00297-0","type":"journal-article","created":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T13:02:43Z","timestamp":1625835763000},"page":"55-88","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Compact representations of structured BFGS matrices"],"prefix":"10.1007","volume":"80","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-3748-2440","authenticated-orcid":false,"given":"Johannes J.","family":"Brust","sequence":"first","affiliation":[]},{"given":"Zichao","family":"Di","sequence":"additional","affiliation":[]},{"given":"Sven","family":"Leyffer","sequence":"additional","affiliation":[]},{"given":"Cosmin G.","family":"Petra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,9]]},"reference":[{"issue":"1","key":"297_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988). https:\/\/doi.org\/10.1093\/imanum\/8.1.141","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"297_CR2","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1137\/16M1065100","volume":"29","author":"P Boggs","year":"2019","unstructured":"Boggs, P., Byrd, R.: Adaptive, limited-memory bfgs algorithms for unconstrained optimization. SIAM J. Optim. 29(2), 1282\u20131299 (2019). https:\/\/doi.org\/10.1137\/16M1065100","journal-title":"SIAM J. Optim."},{"issue":"1","key":"297_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1049\/ip-f-1.1983.0003","volume":"130","author":"DH Brandwood","year":"1983","unstructured":"Brandwood, D.H.: A complex gradient operator and its application in adaptive array theory. IEEE Proc. F Commun. Radar Signal Process. 130(1), 11\u201316 (1983)","journal-title":"IEEE Proc. F Commun. Radar Signal Process."},{"issue":"1","key":"297_CR4","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1093\/imamat\/6.1.76","volume":"6","author":"CG Broyden","year":"1970","unstructured":"Broyden, C.G.: The convergence of a class of double-rank minimization algorithms 1. General considerations. IMA J. Appl. Math. 6(1), 76\u201390 (1970). https:\/\/doi.org\/10.1093\/imamat\/6.1.76","journal-title":"IMA J. Appl. Math."},{"issue":"1","key":"297_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10589-019-00112-x","volume":"74","author":"JJ Brust","year":"2019","unstructured":"Brust, J.J., Burdakov, O., Erway, J.B., Marcia, R.F.: A dense initialization for limited-memory quasi-newton methods. Comput. Optim. Appl. 74(1), 121\u2013142 (2019). https:\/\/doi.org\/10.1007\/s10589-019-00112-x","journal-title":"Comput. Optim. Appl."},{"key":"297_CR6","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1137\/10079923X","volume":"21","author":"RH Byrd","year":"2011","unstructured":"Byrd, R.H., Chin, G.M., Neveitt, W., Nocedal, J.: On the use of stochastic hessian information in optimization methods for machine learning. SIAM J. Optim. 21, 977\u2013995 (2011). https:\/\/doi.org\/10.1137\/10079923X","journal-title":"SIAM J. Optim."},{"key":"297_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"RH Byrd","year":"1994","unstructured":"Byrd, R.H., Nocedal, J., Schnabel, R.B.: Representations of quasi-Newton matrices and their use in limited-memory methods. Math. Program. 63, 129\u2013156 (1994)","journal-title":"Math. Program."},{"issue":"3","key":"297_CR8","doi-asserted-by":"publisher","first-page":"27:1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: Libsvm: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2(3), 27:1-27:27 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"297_CR9","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1137\/1019005","volume":"19","author":"J Dennis","year":"1977","unstructured":"Dennis, J., Mor\u00e9, J.: Quasi-newton methods, motivation and theory. SIAM Rev. 19, 46\u201389 (1977)","journal-title":"SIAM Rev."},{"issue":"3","key":"297_CR10","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1145\/355958.355965","volume":"7","author":"JE Dennis Jr","year":"1981","unstructured":"Dennis, J.E., Jr., Gay, D.M., Walsh, R.E.: An adaptive nonlinear least-squares algorithm. ACM Trans. Math. Softw. 7(3), 348\u2013368 (1981). https:\/\/doi.org\/10.1145\/355958.355965","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"297_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00962795","volume":"61","author":"JE Dennis Jr","year":"1989","unstructured":"Dennis, J.E., Jr., Martinez, H.J., Tapia, R.A.: Convergence theory for the structured bfgs secant method with an application to nonlinear least squares. J. Optim. Theory Appl. 61(2), 161\u2013178 (1989). https:\/\/doi.org\/10.1007\/BF00962795","journal-title":"J. Optim. Theory Appl."},{"key":"297_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"3","key":"297_CR13","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1093\/comjnl\/13.3.317","journal-title":"Comput. J."},{"issue":"1","key":"297_CR14","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/18M1223915","volume":"13","author":"SW Fung","year":"2020","unstructured":"Fung, S.W., Di Wendy, Z.: Multigrid optimization for large-scale ptychographic phase retrieval. SIAM J. Imaging Sci. 13(1), 214\u2013233 (2020). https:\/\/doi.org\/10.1137\/18M1223915","journal-title":"SIAM J. Imaging Sci."},{"key":"297_CR15","first-page":"311","volume":"11","author":"PE Gill","year":"2010","unstructured":"Gill, P.E., Murray, W.: Algorithms for the solution of the nonlinear least-squares problem. SIAM J. Numer. Anal. 11, 311\u2013365 (2010)","journal-title":"SIAM J. Numer. Anal."},{"key":"297_CR16","doi-asserted-by":"publisher","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. Comp. 24, 23\u201326 (1970). https:\/\/doi.org\/10.1090\/S0025-5718-1970-0258249-6","journal-title":"Math. Comp."},{"issue":"4","key":"297_CR17","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEr and SifDec: a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4), 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"297_CR18","unstructured":"Mahajan, A., Leyffer, S., Kirches, C.: Solving mixed-integer nonlinear programs by qp diving. Technical Report ANL\/MCS-P2071-0312, Mathematics and Computer Science Division, Argonne National Laboratory, Lemont, IL (2012)"},{"issue":"3","key":"297_CR19","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1145\/192115.192132","volume":"20","author":"JJ Mor\u00e9","year":"1994","unstructured":"Mor\u00e9, J.J., Thuente, D.J.: Line search algorithms with guaranteed sufficient decrease. ACM Trans. Math. Softw. 20(3), 286\u2013307 (1994). https:\/\/doi.org\/10.1145\/192115.192132","journal-title":"ACM Trans. Math. Softw."},{"key":"297_CR20","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comput. 35, 773\u2013782 (1980)","journal-title":"Math. Comput."},{"key":"297_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer-Verlag, New York (1999)"},{"issue":"2","key":"297_CR22","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1137\/18M1167942","volume":"29","author":"C Petra","year":"2019","unstructured":"Petra, C., Chiang, N., Anitescu, M.: A structured quasi-newton algorithm for optimizing with incomplete hessian information. SIAM J. Optim. 29(2), 1048\u20131075 (2019). https:\/\/doi.org\/10.1137\/18M1167942","journal-title":"SIAM J. Optim."},{"key":"297_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0939-3","volume-title":"Theory of Complex Functions","author":"R Remmert","year":"1991","unstructured":"Remmert, R.: Theory of Complex Functions. Springer-Verlag, New York (1991)"},{"key":"297_CR24","doi-asserted-by":"publisher","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, 647\u2013656 (1970). https:\/\/doi.org\/10.1090\/S0025-5718-1970-0274029-X","journal-title":"Math. Comput."},{"issue":"3","key":"297_CR25","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1137\/110832124","volume":"22","author":"L Sorber","year":"2012","unstructured":"Sorber, L., Barel, M.V., Lathauwer, L.D.: Unconstrained optimization of real functions in complex variables. SIAM J. Optim. 22(3), 879\u2013898 (2012). https:\/\/doi.org\/10.1137\/110832124","journal-title":"SIAM J. Optim."},{"key":"297_CR26","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/8996.001.0001","volume-title":"Optimization for Machine Learning","author":"S Sra","year":"2011","unstructured":"Sra, S., Nowozin, S., Wright, S.J.: Optimization for Machine Learning. The MIT Press, New York (2011)"},{"key":"297_CR27","first-page":"311","volume":"11","author":"CH Teo","year":"2010","unstructured":"Teo, C.H., Vishwanthan, S., Smola, A.J., Le, Q.V.: Bundle methods for regularized risk minimization. J. Mach. Learn. Res. 11, 311\u2013365 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"297_CR28","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106, 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"297_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01586927","author":"H Yabe","year":"1991","unstructured":"Yabe, H., Takahashi, T.: Factorized quasi-newton methods for nonlinear least squares problems. Math. Program. (1991). https:\/\/doi.org\/10.1007\/BF01586927","journal-title":"Math. Program."},{"key":"297_CR30","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1145\/279232.279236","volume":"23","author":"C Zhu","year":"1997","unstructured":"Zhu, C., Byrd, R., Nocedal, J.: Algorithm 778: L-BFGS-B: fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Softw. 23, 550\u2013560 (1997)","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00297-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00297-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00297-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T17:22:14Z","timestamp":1627752134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00297-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,9]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["297"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00297-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,9]]},"assertion":[{"value":"30 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}