{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T13:54:32Z","timestamp":1718114072534},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,7,2]],"date-time":"2015-07-02T00:00:00Z","timestamp":1435795200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"CNR-INSEAN, National Research Council - Maritime Research Centre","award":["RITMARE 2012-2016"],"award-info":[{"award-number":["RITMARE 2012-2016"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s10589-015-9765-1","type":"journal-article","created":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T06:19:35Z","timestamp":1435731575000},"page":"399-429","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization"],"prefix":"10.1007","volume":"65","author":[{"given":"Giovanni","family":"Fasano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Roma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,2]]},"reference":[{"key":"9765_CR1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1137\/S1064827596305258","volume":"20","author":"J Baglama","year":"1998","unstructured":"Baglama, J., Calvetti, D., Golub, G., Reichel, L.: Adaptively preconditioned GMRES algorithms. SIAM J. Sci. Comput. 20, 243\u2013269 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"9765_CR2","doi-asserted-by":"crossref","first-page":"A192","DOI":"10.1137\/110840819","volume":"35","author":"S Bellavia","year":"2013","unstructured":"Bellavia, S., Gondzio, J., Morini, B.: A matrix-free preconditioner for sparse symmetric positive definite systems and least-squares problems. SIAM J. Sci. Comput. 35, A192\u2013A211 (2013)","journal-title":"SIAM J. Sci. Comput."},{"key":"9765_CR3","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1006\/jcph.2002.7176","volume":"182","author":"M Benzi","year":"2002","unstructured":"Benzi, M.: Preconditioning techniques for large linear systems: a survey. J. Comput. Phys. 182, 418\u2013477 (2002)","journal-title":"J. Comput. Phys."},{"key":"9765_CR4","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.1137\/S1064827599356900","volume":"22","author":"M Benzi","year":"2000","unstructured":"Benzi, M., Cullum, J., Tuma, M.: Robust approximate inverse preconditioner for the conjugate gradient method. SIAM J. Sci. Comput. 22, 1318\u20131332 (2000)","journal-title":"SIAM J. Sci. Comput."},{"key":"9765_CR5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/S0168-9274(98)00118-4","volume":"30","author":"M Benzi","year":"1999","unstructured":"Benzi, M., Tuma, M.: A comparative study of sparse approximate inverse preconditioners. Appl. Numer. Math. 30, 305\u2013340 (1999)","journal-title":"Appl. Numer. Math."},{"key":"9765_CR6","doi-asserted-by":"crossref","DOI":"10.1515\/9781400833344","volume-title":"Matrix Mathematics: Theory, Facts, and Formulas","author":"D Bernstein","year":"2009","unstructured":"Bernstein, D.: Matrix Mathematics: Theory, Facts, and Formulas, 2nd edn. Princeton University Press, Princeton (2009)","edition":"2"},{"key":"9765_CR7","series-title":"MPS-SIAM Series on Optimization","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. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2000)"},{"key":"9765_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"9765_CR9","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s10957-005-2087-1","volume":"125","author":"G Fasano","year":"2005","unstructured":"Fasano, G.: Planar-conjugate gradient algorithm for large-scale unconstrained optimization, Part 1: Theory. J. Optim. Theory Appl. 125, 523\u2013541 (2005)","journal-title":"J. Optim. Theory Appl."},{"key":"9765_CR10","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10589-007-9034-z","volume":"38","author":"G Fasano","year":"2007","unstructured":"Fasano, G., Roma, M.: Iterative computation of negative curvature directions in large scale optimization. Comput. Optim. Appl. 38, 81\u2013104 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"9765_CR11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10589-013-9563-6","volume":"56","author":"G Fasano","year":"2013","unstructured":"Fasano, G., Roma, M.: Preconditioning Newton-Krylov methods in non-convex large scale optimization. Comput. Optim. Appl. 56, 253\u2013290 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"9765_CR12","unstructured":"Fasano, G., Roma, M.: An estimation of the condition number for a class of indefinite preconditioned matrices. Technical Report n.1\u20132015, Dipartimento di Ingegneria Informatica, Automatica e Gestionale, SAPIENZA, Universit\u00e0 di Roma, Italy (2015). http:\/\/www.dis.uniroma1.it\/~bibdis"},{"key":"9765_CR13","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"G Golub","year":"2013","unstructured":"Golub, G., Van Loan, C.: Matrix Computations, 4th edn. The John Hopkins Press, Baltimore (2013)","edition":"4"},{"key":"9765_CR14","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10589-010-9361-3","volume":"51","author":"J Gondzio","year":"2013","unstructured":"Gondzio, J.: Matrix-free interior point method. Comput. Optim. Appl. 51, 457\u2013480 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"9765_CR15","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2015","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60, 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"9765_CR16","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1137\/08074008","volume":"21","author":"S Gratton","year":"2011","unstructured":"Gratton, S., Sartenaer, A., Tshimanga, J.: On a class of limited memory preconditioners for large scale linear systems with multiple right-hand sides. SIAM J. Optim. 21, 912\u2013935 (2011)","journal-title":"SIAM J. Optim."},{"key":"9765_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6048-6","volume-title":"Conjugate Direction Methods in Optimization","author":"M Hestenes","year":"1980","unstructured":"Hestenes, M.: Conjugate Direction Methods in Optimization. Springer, New York (1980)"},{"key":"9765_CR18","unstructured":"Luk\u0161an, L., Matonoha, C., Vl\u010dek, J.: Band preconditioners for the matrix-free truncated Newton method, Technical Report V-1079, Institute of Computer Science AS CR, Pod Vodarenskou Vezi 2, 18207 Prague 8 (2010)"},{"key":"9765_CR19","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1137\/S1052623497327854","volume":"10","author":"J Morales","year":"2000","unstructured":"Morales, J., Nocedal, J.: Automatic preconditioning by limited memory quasi-Newton updating. SIAM J. Optim. 10, 1079\u20131096 (2000)","journal-title":"SIAM J. Optim."},{"key":"9765_CR20","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0377-0427(00)00426-X","volume":"124","author":"S Nash","year":"2000","unstructured":"Nash, S.: A survey of truncated-Newton methods. J. Comput. Appl. Math. 124, 45\u201359 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"9765_CR21","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1137\/0716059","volume":"16","author":"L Nazareth","year":"1979","unstructured":"Nazareth, L.: A relationship between the BFGS and conjugate gradient algorithms and its implications for new algorithms. SIAM J. Numer. Anal. 16, 794\u2013800 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"9765_CR22","series-title":"Springer Series in Operations Research and Financial Engineering","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2000","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering, 2nd edn. Springer, New York (2000)","edition":"2"},{"issue":"213","key":"9765_CR23","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0024-3795(94)90401-4","volume":"212","author":"D O\u2019Leary","year":"1994","unstructured":"O\u2019Leary, D., Yeremin, A.: The linear algebra of block quasi-Newton algorithms. Linear Algebra Appl. 212(213), 153\u2013168 (1994)","journal-title":"Linear Algebra Appl."},{"key":"9765_CR24","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003)","edition":"2"},{"key":"9765_CR25","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1007\/978-3-642-68874-4_21","volume-title":"Mathematical Programming. The State of the Art","author":"J Stoer","year":"1983","unstructured":"Stoer, J.: Solution of large linear systems of equations by conjugate gradient type methods. In: Bachem, A., Gr\u00f6tschel, M., Korte, B. (eds.) Mathematical Programming. The State of the Art, pp. 540\u2013565. Springer, Berlin (1983)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9765-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-015-9765-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9765-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9765-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T22:27:36Z","timestamp":1691792856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-015-9765-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,2]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["9765"],"URL":"https:\/\/doi.org\/10.1007\/s10589-015-9765-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,2]]}}}