{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:52:54Z","timestamp":1752461574882,"version":"3.41.2"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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,1]]},"DOI":"10.1023\/a:1008628114432","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"27-40","source":"Crossref","is-referenced-by-count":16,"title":["Impact of Partial Separability on Large-Scale Optimization"],"prefix":"10.1007","volume":"7","author":[{"given":"Ali","family":"Bouaricha","sequence":"first","affiliation":[]},{"given":"Jorge J.","family":"Mor\u00e8","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"118357_CR1","doi-asserted-by":"crossref","unstructured":"B. M. Averick, R. G. Carter, J. J. Mor\u00e9, and G-L. Xue. The MINPACK-2 test problem collection. Preprint MCS-P153-0692, Mathematics and Computer Science Division, Argonne National Laboratory, 1992.","DOI":"10.2172\/79972"},{"key":"118357_CR2","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1137\/0804041","volume":"4","author":"B. M. Averick","year":"1994","unstructured":"B. M. Averick and J. J. Mor\u00e9. Evaluation of large-scale optimization problems on vector and parallel architectures. SIAM J. Optimization, 4:708\u2013721, 1994.","journal-title":"SIAM J. Optimization"},{"key":"118357_CR3","volume-title":"Preprint","author":"C. Bischof","year":"1995","unstructured":"Christian Bischof, Ali Bouaricha, Peyvand Kahdemi, and Jorge J. Mor\u00e9. Computing gradients in large-scale optimization using automatic differentiation. Preprint MCS-P488-0195, Argonne National Laboratory, Argonne, Illinois, 1995."},{"issue":"1","key":"118357_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/1992\/717832","volume":"1","author":"C. Bischof","year":"1992","unstructured":"Christian Bischof, Alan Carle, George Corliss, Andreas Griewank, and Paul Hovland. ADIFOR: Generating derivative codes from Fortran programs. Scientific Programming, 1(1):1\u201329, 1992.","journal-title":"Scientific Programming"},{"key":"118357_CR5","series-title":"Technical Report","volume-title":"Fortran 77 interface specification to the SparsLinC library","author":"C. Bischof","year":"1994","unstructured":"Christian Bischof, Alan Carle, and Peyvand Khademi. Fortran 77 interface specification to the SparsLinC library. Technical Report ANL\/MCS-TM-196, Argonne National Laboratory, Argonne, Illinois, 1994."},{"key":"118357_CR6","volume-title":"Preprint","author":"C. Bischof","year":"1994","unstructured":"Christian Bischof, Alan Carle, Peyvand Khademi, and Andrew Mauer. The ADIFOR 2.0 system for the automatic differentiation of Fortran 77 programs. Preprint MCS-P381-1194, Argonne National Laboratory, Argonne, Illinois, 1994. Also available as CRPC-TR94491, Center for Research on Parallel Computation, Rice University."},{"key":"118357_CR7","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1145\/1271.319415","volume":"10","author":"T. F. Coleman","year":"1984","unstructured":"T. F. Coleman, B. S. Garbow, and J. J. Mor\u00e9. Fortran subroutines for estimating sparse Jacobian matrices. ACM Trans. Math. Software, 10:346\u2013347, 1984.","journal-title":"ACM Trans. Math. Software"},{"key":"118357_CR8","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/1271.1610","volume":"10","author":"T. F. Coleman","year":"1984","unstructured":"T. F. Coleman, B. S. Garbow, and J. J. Mor\u00e9. Software for estimating sparse Jacobian matrices. ACM Trans. Math. Software, 10:329\u2013345, 1984.","journal-title":"ACM Trans. Math. Software"},{"key":"118357_CR9","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/0720013","volume":"20","author":"T. F. Coleman","year":"1983","unstructured":"T. F. Coleman and J. J. Mor\u00e9. Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer. Anal., 20:187\u2013209, 1983.","journal-title":"SIAM J. Numer. Anal."},{"key":"118357_CR10","doi-asserted-by":"crossref","unstructured":"A. R. Conn, N. I. M. Gould, and Ph. L. Toint. LANCELOT. Springer Series in Computational Mathematics. Springer-Verlag, 1992.","DOI":"10.1007\/978-3-662-12211-2"},{"key":"118357_CR11","doi-asserted-by":"crossref","unstructured":"A. Griewank and Ph. L. Toint. Numerical experiments with partially separable optimization problems. In D. F. Griffiths, editor, Numerical Analysis: Proceedings Dundee 1983, Lecture Notes in Mathematics 1066. Springer-Verlag, 1984.","DOI":"10.1007\/BFb0099526"},{"key":"118357_CR12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1080\/10556789208805505","volume":"1","author":"A. Griewank","year":"1992","unstructured":"Andreas Griewank. Achieving logarithmic growth of temporal and spatial complexity in reverse communication. Optim. Methods Software, 1:35\u201354, 1992.","journal-title":"Optim. Methods Software"},{"key":"118357_CR13","doi-asserted-by":"crossref","unstructured":"Andreas Griewank. Some bounds on the complexity of gradients, Jacobians, and Hessians. In P.M. Pardalos, editor, Complexity in Nonlinear Optimization, pages 128\u2013161. World Scientific Publishers, 1993.","DOI":"10.1142\/9789814354363_0008"},{"key":"118357_CR14","unstructured":"Andreas Griewank and George F. Corliss, editors. Automatic Differentiation of Algorithms: Theory, Implementation, and Application. Society for industrial and Applied Mathematics, 1991."},{"key":"118357_CR15","unstructured":"M. Iri. History of automatic differentiation and rounding error estimation. In A. Griewank and G. F. Corliss, editors, Automatic Differentiation of Algorithms, pages 3\u201316. SIAM, 1992."},{"key":"118357_CR16","unstructured":"David Juedes. A taxonomy of automatic differentiation tools. In Andreas Griewank and George Corliss, editors, Automatic Differentiation of Algorithms: Theory, Implementation, and Application, pages 315\u2013329. SIAM, 1991."},{"key":"118357_CR17","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF02186481","volume":"14","author":"M. Lescrenier","year":"1988","unstructured":"M. Lescrenier. Partially separable optimization and parallel computing. Ann. Oper. Res., 14:213\u2013224, 1988.","journal-title":"Ann. Oper. Res."},{"key":"118357_CR18","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"D. C. Liu","year":"1989","unstructured":"D. C. Liu and J. Nocedal. On the limited memory BFGS method for large scale optimization. Math. Programming, 45:503\u2013528, 1989.","journal-title":"Math. Programming"},{"key":"118357_CR19","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1090\/S0025-5718-1986-0815839-9","volume":"46","author":"P. L. Toint","year":"1986","unstructured":"Ph. L. Toint. Numerical solution of large sets of algebraic nonlinear equations. Math. Comp., 46:175\u2013189, 1986.","journal-title":"Math. Comp."},{"key":"118357_CR20","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0908042","volume":"8","author":"P. L. Toint","year":"1987","unstructured":"Ph. L. Toint. On large scale nonlinear least squares calculations. SIAM J. Sci. Statist. Comput., 8:416\u2013435, 1987.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"118357_CR21","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01582254","volume":"48","author":"P. L. Toint","year":"1990","unstructured":"Ph. L. Toint and D. Tuyttens. On large-scale nonlinear network optimization. Math. Programming, 48:125\u2013159, 1990.","journal-title":"Math. Programming"},{"key":"118357_CR22","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1145\/131766.131771","volume":"18","author":"P. L. Toint","year":"1992","unstructured":"Ph. L. Toint and D. Tuyttens. LSNNO: A Fortran subroutine for solving large-scale nonlinear network optimization problems. ACM Trans. Math. Software, 18:308\u2013328, 1992.","journal-title":"ACM Trans. Math. Software"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008628114432.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008628114432\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008628114432.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:25:22Z","timestamp":1752377122000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008628114432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["118357"],"URL":"https:\/\/doi.org\/10.1023\/a:1008628114432","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}