{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:09:28Z","timestamp":1763467768194},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,9,19]],"date-time":"2006-09-19T00:00:00Z","timestamp":1158624000000},"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":[[2007,11,30]]},"DOI":"10.1007\/s10107-006-0022-3","type":"journal-article","created":{"date-parts":[[2006,9,18]],"date-time":"2006-09-18T13:03:54Z","timestamp":1158584634000},"page":"403-425","source":"Crossref","is-referenced-by-count":4,"title":["Dual multilevel optimization"],"prefix":"10.1007","volume":"112","author":[{"given":"Timothy A.","family":"Davis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William W.","family":"Hager","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,9,19]]},"reference":[{"key":"22_CR1","first-page":"221","volume":"71","author":"E.D. Andersen","year":"1995","unstructured":"Andersen E.D., Andersen K.D. (1995) Presolving in linear programming. Math. Program. 71, 221\u2013245","journal-title":"Math. Program."},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/ijoc.6.1.15","volume":"6","author":"R.E. Bixby","year":"1994","unstructured":"Bixby R.E. (1994) Progress in linear programming. ORSA J. Comput. 6, 15\u201322","journal-title":"ORSA J. Comput."},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1137\/S0895479801385037","volume":"23","author":"I. Brainman","year":"2002","unstructured":"Brainman I., Toledo S. (2002) Nested-dissection orderings for sparse LU with partial pivoting. SIAM J. Matrix Anal. Appl. 23, 998\u20131012","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"22_CR4","volume-title":"Multigrid Methods","author":"J.H. Bramble","year":"1993","unstructured":"Bramble J.H. (1993) Multigrid Methods. Wiley, New York"},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1145\/1114268.1114277","volume":"31","author":"T.A. Davis","year":"2005","unstructured":"Davis T.A. (2005) Algorithm 849: a concise sparse Cholesky factorization package. ACM Trans. Math. Softw. 31, 587\u2013591","journal-title":"ACM Trans. Math. Softw."},{"key":"22_CR6","unstructured":"Davis, T.A.: CHOLMOD users\u2019 guide. University of Florida (2005). http: www.cise.ufl.edu\/~davis"},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1145\/1024074.1024079","volume":"30","author":"T.A. Davis","year":"2004","unstructured":"Davis T.A., Gilbert J.R., Larimore S.I., Ng E.G. (2004) A column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 353\u2013376","journal-title":"ACM Trans. Math. Softw."},{"key":"22_CR8","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/S0895479897321076","volume":"20","author":"T.A. Davis","year":"1999","unstructured":"Davis T.A., Hager W.W. (1999) Modifying a sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 20, 606\u2013627","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1137\/S0895479899357346","volume":"22","author":"T.A. Davis","year":"2001","unstructured":"Davis T.A., Hager W.W. (2001) Multiple-rank modifications of a sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 22, 997\u20131013","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"22_CR10","unstructured":"Davis, T.A., Hager, W.W.: A sparse proximal implementation of the LP dual active set\u00a0algorithm. Math. Program (in press) (2006). DOI 10.1007\/s10107-006-0017-0"},{"key":"22_CR11","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1137\/S089547980343641X","volume":"26","author":"T.A. Davis","year":"2005","unstructured":"Davis T.A., Hager W.W. (2005) Row modifications of a sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 26, 621\u2013639","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"22_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/77626.79170","volume":"16","author":"J. Dongarra","year":"1990","unstructured":"Dongarra J., Du Croz J., Hammarling S., Duff I. (1990) A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16, 1\u201317","journal-title":"ACM Trans. Math. Softw."},{"key":"22_CR13","first-page":"35","volume":"80","author":"M.C. Ferris","year":"1998","unstructured":"Ferris M.C., Horn J.D. (1998) Partitioning mathematical programs for parallel solution. Math. Program. 80, 35\u201362","journal-title":"Math. Program."},{"key":"22_CR14","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/s10107-003-0379-5","volume":"96","author":"J. Gondzio","year":"2003","unstructured":"Gondzio J., Sarkissian R. (2003) Parallel interior-point solver for structured linear programs. Math. Prog. 96, 561\u2013584","journal-title":"Math. Prog."},{"key":"22_CR15","unstructured":"Goto, K., van de Geijn, R.: On reducing TLB misses in matrix multiplication. TR-2002-55, University of Texas at Austin, Departmentn of Computer Sciences (2002)"},{"key":"22_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02427-0","volume-title":"Multigrid Methods and Applications","author":"W. Hackbusch","year":"1985","unstructured":"Hackbusch W. (1985) Multigrid Methods and Applications. Springer, Berlin Heidelberg New York"},{"key":"22_CR17","unstructured":"Hager, W.W.: The dual active set\u00a0algorithm. In: Pardalos, P.M. (ed.) Advances in Optimization and Parallel Computing 137\u2013142. North Holland, Amsterdam (1992)"},{"key":"22_CR18","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/978-1-4613-3279-4_16","volume-title":"High Performance Algorithms and Software in Nonlinear Optimization","author":"W.W. Hager","year":"1998","unstructured":"Hager W.W. (1998) The LP dual active set\u00a0algorithm. In: Leone R.D., Murli A., Pardalos P.M., Toraldo G. (eds) High Performance Algorithms and Software in Nonlinear Optimization. Kluwer, Dordrecht, pp. 243\u2013254"},{"key":"22_CR19","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1013773102688","volume":"21","author":"W.W. Hager","year":"2002","unstructured":"Hager W.W. (2002) The dual active set\u00a0algorithm and its application to linear programming. Comput. Optim. Appl. 21, 263\u2013275","journal-title":"Comput. Optim. Appl."},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Hager W.W.: The dual active set\u00a0algorithm and the iterative solution of linear programs. In: Pardalos, P.M., Wolkowicz, H. (eds.) Novel Approaches to Hard Discrete Optimization pp. 95\u2013107, vol. 37. Fields Institute Communications (2003)","DOI":"10.1090\/fic\/037\/06"},{"key":"22_CR21","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF00248762","volume":"1","author":"W.W. Hager","year":"1993","unstructured":"Hager W.W., Hearn D.W. (1993) Application of the dual active set\u00a0algorithm to quadratic network optimization. Comput. Optim. Appl. 1, 349\u2013373","journal-title":"Comput. Optim. Appl."},{"key":"22_CR22","unstructured":"Hager, W.W., Shi, C.-L., Lundin, E.O.: Active set strategies in the LP dual active set\u00a0algorithm, Tech. Report, University of Florida, http:\/\/www.math.ufl.edu\/~hager\/LPDASA (1996)"},{"key":"22_CR23","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10589-005-4802-0","volume":"32","author":"J.A.J. Hall","year":"2005","unstructured":"Hall J.A.J., McKinnon K.I.M. (2005) Hyper-sparsity in the revised simplex method and how to exploit it. Comput. Optim. Appl. 32, 259\u2013283","journal-title":"Comput. Optim. Appl."},{"key":"22_CR24","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1137\/S0895479892238270","volume":"16","author":"M.T. Heath","year":"1995","unstructured":"Heath M.T., Raghavan P. (1995) A Cartesian parallel nested dissection algorithm. SIAM J. Matrix Anal. Appl. 16, 235\u2013253","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Proc. Supercomputing \u201995, ACM (1995)","DOI":"10.1145\/224170.224228"},{"key":"22_CR26","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1137\/S1064827596300656","volume":"20","author":"B. Hendrickson","year":"1999","unstructured":"Hendrickson B., Rothberg E. (1999) Improving the runtime and quality of nested dissection ordering. SIAM J. Sci. Comput. 20, 468\u2013489","journal-title":"SIAM J. Sci. Comput."},{"key":"22_CR27","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis G., Kumar V. (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359\u2013392","journal-title":"SIAM J. Sci. Comput."},{"key":"22_CR28","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G. Karypis","year":"1999","unstructured":"Karypis G., Kumar V. (1999) Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48, 96\u2013129","journal-title":"J. Parallel Distrib. Comput."},{"key":"22_CR29","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1137\/S0036144598334138","volume":"41","author":"G. Karypis","year":"1999","unstructured":"Karypis G., Kumar V. (1999) Parallel multilevel k-way partitioning scheme for irregular graphs. SIAM Rev. 41, 278\u2013300","journal-title":"SIAM Rev."},{"key":"22_CR30","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1145\/103147.103159","volume":"17","author":"J.W.H. Liu","year":"1991","unstructured":"Liu J.W.H. (1991) A generalized envelope method for sparse factorization by rows. ACM Trans. Math. Softw. 17, 112\u2013129","journal-title":"ACM Trans. Math. Softw."},{"key":"22_CR31","volume-title":"Linear and Nonlinear Programming","author":"D.G. Luenberger","year":"1984","unstructured":"Luenberger D.G. (1984) Linear and Nonlinear Programming. Addison Wesley, Reading"},{"key":"22_CR32","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1002\/j.1538-7305.1948.tb00917.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon C.E. (1948) A mathematical theory of communication. Bell Syst. Tech. J. 27, 623\u2013653","journal-title":"Bell Syst. Tech. J."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0022-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0022-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0022-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:00Z","timestamp":1559123400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0022-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,19]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,11,30]]}},"alternative-id":["22"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0022-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9,19]]}}}