{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:09:18Z","timestamp":1763467758751},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,8,18]],"date-time":"2006-08-18T00:00:00Z","timestamp":1155859200000},"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-0017-0","type":"journal-article","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T14:20:07Z","timestamp":1155824407000},"page":"275-301","source":"Crossref","is-referenced-by-count":6,"title":["A sparse proximal implementation of the LP dual active set algorithm"],"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,8,18]]},"reference":[{"key":"17_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":"17_CR2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/A:1015489608037","volume":"22","author":"M. Bergounioux","year":"2002","unstructured":"Bergounioux M., Kunisch K. (2002) Primal-dual strategy for state-constrained optimal control problem. Comput. Optim. Appl. 22, 193\u2013224","journal-title":"Comput. Optim. Appl."},{"key":"17_CR3","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":"17_CR4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01930845","volume":"19","author":"A. Bj\u00f6rck","year":"1979","unstructured":"Bj\u00f6rck A., Elfving T. (1979) Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations. BIT 19, 145\u2013163","journal-title":"BIT"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1090\/S0002-9947-1975-0367131-6","volume":"205","author":"F.H. Clarke","year":"1975","unstructured":"Clarke F.H. (1975) Generalized gradients and applications. Trans. Am. Math. Soc. 205, 247\u2013262","journal-title":"Trans. Am. Math. Soc."},{"key":"17_CR6","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":"17_CR7","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/1024074.1024080","volume":"30","author":"T.A. Davis","year":"2004","unstructured":"Davis T.A., Gilbert J.R., Larimore S.I., Ng E.G. (2004) Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 377\u2013380","journal-title":"ACM Trans. Math. Softw."},{"key":"17_CR8","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":"17_CR9","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":"17_CR10","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":"17_CR11","unstructured":"Davis T.A., Hager W.W. Dual multilevel optimization, to appear in Mathematical Programming University of Florida (2004)"},{"key":"17_CR12","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":"17_CR13","doi-asserted-by":"crossref","unstructured":"Davis, T.A., Hager, W.W., Chen, Y.C., Rajamanickam, S. CHOLMOD: a sparse Cholesky factorization and modification package, ACM Trans. Math. Softw. (2006) (in preparation)","DOI":"10.1090\/S0002-9947-05-03741-4"},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/77626.79170","volume":"16","author":"J.J. Dongarra","year":"1990","unstructured":"Dongarra J.J., Du Croz J.J., Duff I.S., Hammarling S. (1990) A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16, 1\u201317","journal-title":"ACM Trans. Math. Softw."},{"key":"17_CR15","unstructured":"Ekeland, I., Temam, R. Convex Analysis and Variational Problems. North-Holland, Amsterdam (1976)"},{"key":"17_CR16","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1137\/S0895479893252623","volume":"17","author":"P.E. Gill","year":"1996","unstructured":"Gill P.E., Saunders M.A., Shinnerl J.R. (1996) On the stability of cholesky factorization for quasi-definite systems. SIAM J. Matrix Anal. Appl. 17, 35\u201346","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"17_CR17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0024-3795(79)90122-8","volume":"28","author":"G.H. Golub","year":"1979","unstructured":"Golub G.H., Loan C.F.V. (1979) Unsymmetric positive definite linear systems. Linear Algebra Appl. 28, 85\u201398","journal-title":"Linear Algebra Appl."},{"key":"17_CR18","first-page":"5","volume":"8","author":"W.W. Hager","year":"1979","unstructured":"Hager W.W. (1979) Convex control and dual approximations, part I. Control Cybern. 8, 5\u201322","journal-title":"Control Cybern."},{"key":"17_CR19","unstructured":"Hager, W.W. Inequalities and approximation. In: Coffman, C.V., Fix, G.J. (eds.) Constructive Approaches to Mathematical Models pp. 189\u2013202. (1979)"},{"key":"17_CR20","unstructured":"Hager, W.W. The dual active set algorithm. In: Pardalos, P.M. (ed.) Advances in Optimization and Parallel Computing pp. 137\u2013142. North Holland, Amsterdam (1992)"},{"key":"17_CR21","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 algorithm. 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":"17_CR22","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1137\/S106482759834634X","volume":"22","author":"W.W. Hager","year":"2000","unstructured":"Hager W.W. (2000) Iterative methods for nearly singular linear systems. SIAM J. Sci. Comput. 22, 747\u2013766","journal-title":"SIAM J. Sci. Comput."},{"key":"17_CR23","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 algorithm and its application to linear programming. Comput. Optim. Appl. 21, 263\u2013275","journal-title":"Comput. Optim. Appl."},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Hager, W.W. The dual active set algorithm and the iterative solution of linear programs. In: Pardalos, P.M., Wolkowicz, H. (eds.) Novel Approaches to Hard Discrete Optimization, vol. 37, pp. 95\u2013107 Fields Institute Communications, (2003)","DOI":"10.1090\/fic\/037\/06"},{"key":"17_CR25","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 algorithm to quadratic network optimization. Comput. Optim. Appl. 1, 349\u2013373","journal-title":"Comput. Optim. Appl."},{"key":"17_CR26","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0322027","volume":"22","author":"W.W. Hager","year":"1984","unstructured":"Hager W.W., Ianculescu G. (1984) Dual approximations in optimal control. SIAM J. Control Optim. 22, 423\u2013465","journal-title":"SIAM J. Control Optim."},{"key":"17_CR27","unstructured":"Hager, W.W., Shi, C.-L., Lundin, E.O. Active set strategies in the LP dual active set algorithm, tech. report. University of Florida, http:\/\/www.math.ufl.edu\/~hager\/LPDASA (1996)"},{"key":"17_CR28","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":"17_CR29","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":"17_CR30","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":"17_CR31","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":"17_CR32","first-page":"154","volume":"4","author":"B. Martinet","year":"1970","unstructured":"Martinet B. (1970) R\u00e9gularisation d\u2019in\u00e9quations variationnelles par approximations successives. Rev. Francaise Inform. Rech. Oper. Ser. R-3 4, 154\u2013158","journal-title":"Rev. Francaise Inform. Rech. Oper. Ser. R-3"},{"key":"17_CR33","first-page":"163","volume":"274","author":"B. Martinet","year":"1972","unstructured":"Martinet B. (1972) Determination approach\u00e9e d\u2019un point fixe d\u2019une application pseudo-contractante. Comptes Rendus des S\u00e9ances de l\u2019Acad\u00e9mie des Sciences 274, 163\u2013165","journal-title":"Comptes Rendus des S\u00e9ances de l\u2019Acad\u00e9mie des Sciences"},{"key":"17_CR34","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1137\/0914063","volume":"14","author":"E.G. Ng","year":"1993","unstructured":"Ng E.G., Peyton B.W. (1993) Block sparse Cholesky algorithms on advanced uniprocessor computers. SIAM J. Sci. Comput. 14, 1034\u20131056","journal-title":"SIAM J. Sci. Comput."},{"key":"17_CR35","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1023\/B:COAP.0000044185.69640.54","volume":"29","author":"P.Q. Pan","year":"2004","unstructured":"Pan P.Q. (2004) A dual projective pivot algorithm for linear programming. Comput. Optim. Appl. 29, 333\u2013346","journal-title":"Comput. Optim. Appl."},{"key":"17_CR36","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"R.T. Rockafellar","year":"1976","unstructured":"Rockafellar R.T. (1976) Monotone operators and the proximal point algorithm. SIAM J. Control 14, 877\u2013898","journal-title":"SIAM J. Control"},{"key":"17_CR37","volume-title":"Theory and Algorithms for Linear Optimization: An Interior Point Approach","author":"C. Roos","year":"1997","unstructured":"Roos C., Terlaky T., Vial J.-P. (1997) Theory and Algorithms for Linear Optimization: An Interior Point Approach. Wiley, New York"},{"key":"17_CR38","first-page":"92","volume-title":"Linear and Nonlinear Conjugate Gradient-Related Methods","author":"M.A. Saunders","year":"1996","unstructured":"Saunders M.A. (1996). Cholesky-based methods for sparse least squares: The benefits of regularization. In: Adams L., Nazareth J.L. (eds). Linear and Nonlinear Conjugate Gradient-Related Methods. SIAM, Philadelpha, pp. 92\u2013100"},{"key":"17_CR39","unstructured":"Shih, C.L. Active Set Strategies in Optimization. PhD Thesis, University of Florida, Department of Mathematics (1995)"},{"key":"17_CR40","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0805005","volume":"5","author":"R.J. Vanderbei","year":"1995","unstructured":"Vanderbei R.J. (1995) Symmetric quasi-definite matrices. SIAM J. Optim. 5, 100\u2013113","journal-title":"SIAM J. Optim."},{"key":"17_CR41","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1026047622744","volume":"26","author":"S. Volkwein","year":"2003","unstructured":"Volkwein S. (2003) Lagrange-SQP techniques for the control constrained optimal boundary control for Burger\u2019s equation. Comput. Optim. Appl. 26, 253\u2013284","journal-title":"Comput. Optim. Appl."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0017-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0017-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0017-0","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-0017-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,18]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,11,30]]}},"alternative-id":["17"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0017-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,18]]}}}