{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T17:48:37Z","timestamp":1783100917566,"version":"3.54.6"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,6,19]],"date-time":"2007-06-19T00:00:00Z","timestamp":1182211200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s10107-007-0137-1","type":"journal-article","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T13:25:15Z","timestamp":1182173115000},"page":"1-30","source":"Crossref","is-referenced-by-count":20,"title":["Sparse quasi-Newton updates with positive definite matrix completion"],"prefix":"10.1007","volume":"115","author":[{"given":"Nobuo","family":"Yamashita","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,6,19]]},"reference":[{"key":"137_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4613-8369-7_1","volume-title":"Graph Theory and Sparse Matrix Computation","author":"J.R.S. Blair","year":"1993","unstructured":"Blair J.R.S. and Peyton B. (1993). An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R. and Liu, J.W.H. (eds) Graph Theory and Sparse Matrix Computation, pp 1\u201329. Springer, New York"},{"key":"137_CR2","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1145\/6187.6190","volume":"11","author":"T.F. Coleman","year":"1985","unstructured":"Coleman T.F., Garbow B. and Mor\u00e9 J.J. (1985). Software for estimating sparse Hessian matrices. ACM Trans. Math. Softw. 11: 363\u2013378","journal-title":"ACM Trans. Math. Softw."},{"key":"137_CR3","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I.M., Toint, Ph.L.: LANCELOT: a Fortran package for large-scale nonlinear optimization (Release A). In: Springer Series in Computational Mathematics, vol. 17. Springer, New York (1992)","DOI":"10.1007\/978-3-662-12211-2"},{"issue":"126","key":"137_CR4","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1090\/S0025-5718-1974-0343581-1","volume":"28","author":"J.E. Dennis Jr","year":"1974","unstructured":"Mor\u00e9 J.J. and Dennis J.E. (1974). A characterization of superlinear convergence and its application to quasi-Newton methods. Math. Comput. 28(126): 549\u2013560","journal-title":"Math. Comput."},{"key":"137_CR5","volume-title":"Numerical methods for unconstrained optimization and nonlinear equations","author":"J.E. Dennis Jr","year":"1983","unstructured":"Schnabel R.B. and Dennis J.E. (1983). Numerical methods for unconstrained optimization and nonlinear equations. Prentice-Hall Inc., New Jersey"},{"key":"137_CR6","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1137\/0801002","volume":"1","author":"R. Fletcher","year":"1991","unstructured":"Fletcher R. (1991). A new result for quasi-Newton formulae. SIAM J. Optim. 1: 18\u201321","journal-title":"SIAM J. Optim."},{"key":"137_CR7","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1137\/0805010","volume":"5","author":"R. Fletcher","year":"1995","unstructured":"Fletcher R. (1995). An optimal positive definite update for sparse Hessian matrices. SIAM J. Optim. 5: 192\u2013218","journal-title":"SIAM J. Optim."},{"key":"137_CR8","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S1052623400366218","volume":"11","author":"M. Fukuda","year":"2000","unstructured":"Fukuda M., Kojima M., Murota K. and Nakata K. (2000). Exploiting sparsity in semidefinite programming via matrix completion I: general framework. SIAM J. Optim. 11: 647\u2013674","journal-title":"SIAM J. Optim."},{"key":"137_CR9","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"A. George","year":"1981","unstructured":"George A. and Liu J.W.H. (1981). Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliff"},{"key":"137_CR10","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"N.I.M. Gould","year":"2003","unstructured":"Gould N.I.M., Orban D. and Toint Ph.L. (2003). CUTEr, a constrained and unconstrained testing environment: revisited. ACM Trans. Math. Softw. 29: 373\u2013394","journal-title":"ACM Trans. Math. Softw."},{"key":"137_CR11","first-page":"301","volume-title":"Nonlinear Optimization 1981","author":"A. Griewank","year":"1982","unstructured":"Griewank A. and Toint Ph.L. (1982). On the unconstrained optimization of partially separable functions. In: Powell, M.J.D. (eds) Nonlinear Optimization 1981, pp 301\u2013312. Academic, London"},{"key":"137_CR12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF01399316","volume":"39","author":"A. Griewank","year":"1982","unstructured":"Griewank A. and Toint Ph.L. (1982). Partitioned variable metric updates for large structured optimization problems. Numer. Math. 39: 119\u2013137","journal-title":"Numer. Math."},{"key":"137_CR13","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02612711","volume":"28","author":"A. Griewank","year":"1984","unstructured":"Griewank A. and Toint Ph.L. (1984). On the existence of convex decomposition of partially separable functions. Math. Program. 28: 25\u201329","journal-title":"Math. Program."},{"key":"137_CR14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0024-3795(84)90207-6","volume":"58","author":"R. Grone","year":"1984","unstructured":"Grone R., Johnson C.R., S\u00e1 E.M. and Wolkowicz H. (1984). Positive definite completions of partial Hermitian matrices. Linear Algebra Appl. 58: 109\u2013124","journal-title":"Linear Algebra Appl."},{"key":"137_CR15","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"D.C. Liu","year":"1989","unstructured":"Liu D.C. and Nocedal J. (1989). On the limited memory BFGS method for large scale optimization. Math. Program. 45: 503\u2013528","journal-title":"Math. Program."},{"key":"137_CR16","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J. Nocedal","year":"1980","unstructured":"Nocedal J. (1980). Updating quasi-Newton matrices with limited storage. Math. Comput. 35: 773\u2013782","journal-title":"Math. Comput."},{"key":"137_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"1999","unstructured":"Nocedal J. and Wright S.J. (1999). Numerical Optimization. Springer, New York"},{"key":"137_CR18","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1137\/0716078","volume":"16","author":"M.J.D. Powell","year":"1979","unstructured":"Powell M.J.D. and Toint Ph.L. (1979). On the estimation of sparse Hessian matrices. SIAM J. Numer. Anal. 16: 1060\u20131074","journal-title":"SIAM J. Numer. Anal."},{"key":"137_CR19","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1093\/imanum\/1.4.403","volume":"1","author":"M.J.D. Powell","year":"1981","unstructured":"Powell M.J.D. and Toint Ph.L. (1981). The Shanno-Toint procedure for updating sparse symmetric matrices. IMA J. Numer. Anal. 1: 403\u2013413","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"137_CR20","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02591723","volume":"25","author":"R.B. Schnabel","year":"1983","unstructured":"Schnabel R.B. and Toint Ph.L. (1983). Forcing sparsity by projecting with respect to a non-diagonally weighted Frobenius norm. Math. Program. 25(1): 125\u2013129","journal-title":"Math. Program."},{"key":"137_CR21","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BFb0120977","volume":"18","author":"D.C. Sorensen","year":"1982","unstructured":"Sorensen D.C. (1982). Collinear scaling and sequential estimation in sparse optimization algorithm. Math. Program. Stud. 18: 135\u2013159","journal-title":"Math. Program. Stud."},{"key":"137_CR22","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1090\/S0025-5718-1977-0455338-4","volume":"31","author":"P.L. Toint","year":"1977","unstructured":"Toint P.L. (1977). On sparse and symmetric matrix updating subject to a linear equation. Math. Comput. 31: 954\u2013961","journal-title":"Math. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0137-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-007-0137-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0137-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T11:50:35Z","timestamp":1683892235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-007-0137-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,19]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["137"],"URL":"https:\/\/doi.org\/10.1007\/s10107-007-0137-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,19]]}}}