{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:19:34Z","timestamp":1778249974054,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540239314","type":"print"},{"value":"9783540304999","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30499-9_74","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T09:41:13Z","timestamp":1277890873000},"page":"483-488","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Generalization of Battiti-Shanno\u2019s Quasi-Newton Algorithm for Learning in MLP-Networks"],"prefix":"10.1007","author":[{"given":"Carmine","family":"Di Fiore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Fanelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Zellini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"74_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1019142304382","volume":"22","author":"M. Al Baali","year":"1999","unstructured":"Al Baali, M.: Improved Hessian approximations for the limited memory BFGS method. Numer. Algorithms\u00a022, 99\u2013112 (1999)","journal-title":"Numer. Algorithms"},{"key":"74_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1162\/neco.1992.4.2.141","volume":"4","author":"R. Battiti","year":"1992","unstructured":"Battiti, R.: First- and second-order methods for learning: between steepest descent and Newton\u2019s method. Neural Computation\u00a04, 141\u2013166 (1992)","journal-title":"Neural Computation"},{"key":"74_CR3","doi-asserted-by":"crossref","unstructured":"Bianchini, M., Fanelli, S., Gori, M., Protasi, M.: Non-suspiciousness: a generalization of convexity in the frame of foundations of Numerical Analysis and Learning. In: IJCNN 1998, Anchorage, vol.\u00a0II, pp. 1619\u20131623 (1998)","DOI":"10.1109\/IJCNN.1998.686020"},{"key":"74_CR4","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1109\/12.936235","volume":"50","author":"M. Bianchini","year":"2001","unstructured":"Bianchini, M., Fanelli, S., Gori, M.: Optimal algorithms for well-conditioned nonlinear systems of equations. IEEE Transactions on Computers\u00a050, 689\u2013698 (2001)","journal-title":"IEEE Transactions on Computers"},{"key":"74_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1109\/TNN.2003.809425","volume":"14","author":"A. Bortoletti","year":"2003","unstructured":"Bortoletti, A., Di Fiore, C., Fanelli, S., Zellini, P.: A new class of quasi-newtonian methods for optimal learning in MLP-networks. IEEE Transactions on Neural Networks\u00a014, 263\u2013273 (2003)","journal-title":"IEEE Transactions on Neural Networks"},{"key":"74_CR6","unstructured":"Di Fiore, C., Fanelli, S., Zellini, P.: Matrix algebras in quasi-newtonian algorithms for optimal learning in multi-layer perceptrons. In: ICONIP Workshop and Expo, Dunedin, pp. 27\u201332 (1999)"},{"key":"74_CR7","unstructured":"Di Fiore, C., Fanelli, S., Zellini, P.: Optimisation strategies for nonconvex functions and applications to neural networks. In: ICONIP 2001, Shanghai, vol.\u00a01, pp. 453\u2013458 (2001)"},{"key":"74_CR8","doi-asserted-by":"crossref","unstructured":"Di Fiore, C., Fanelli, S., Zellini, P.: Computational experiences of a novel algorithm for optimal learning in MLP-networks. In: ICONIP 2002, Singapore, vol.\u00a01, pp. 317\u2013321 (2002)","DOI":"10.1109\/ICONIP.2002.1202185"},{"key":"74_CR9","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s00211-002-0410-4","volume":"94","author":"C. Di Fiore","year":"2003","unstructured":"Di Fiore, C., Fanelli, S., Lepore, F., Zellini, P.: Matrix algebras in Quasi-Newton methods for unconstrained optimization. Numerische Mathematik\u00a094, 479\u2013500 (2003)","journal-title":"Numerische Mathematik"},{"key":"74_CR10","unstructured":"Di Fiore, C., Fanelli, S., Zellini, P.: Convex algorithms for optimal learning in MLPnetworks. In: Preparation"},{"key":"74_CR11","volume-title":"Pattern Classification and Scene Analysis","author":"R.O. Duda","year":"1973","unstructured":"Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. Wiley, Chichester (1973)"},{"key":"74_CR12","first-page":"1240","volume":"2","author":"P. Frasconi","year":"1997","unstructured":"Frasconi, P., Fanelli, S., Gori, M., Protasi, M.: Suspiciousness of loading problems. IEEE Int. Conf. on Neural Networks\u00a02, 1240\u20131245 (1997)","journal-title":"IEEE Int. Conf. on Neural Networks"},{"key":"74_CR13","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"D.C. Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Programming\u00a045, 503\u2013528 (1989)","journal-title":"Math. Programming"},{"key":"74_CR14","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, New York (1999)"},{"key":"74_CR15","unstructured":"http:\/\/www.mathworks.com\/access\/helpdesk\/help\/toolbox\/nnet\/backpr14.html"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30499-9_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:09:12Z","timestamp":1778249352000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30499-9_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540239314","9783540304999"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30499-9_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}