{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T05:24:37Z","timestamp":1775798677027,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T00:00:00Z","timestamp":1194566400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2008,11]]},"DOI":"10.1007\/s10589-007-9096-y","type":"journal-article","created":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T02:40:17Z","timestamp":1194489617000},"page":"151-183","source":"Crossref","is-referenced-by-count":47,"title":["Implementation of warm-start strategies in\u00a0interior-point methods for linear programming in\u00a0fixed dimension"],"prefix":"10.1007","volume":"41","author":[{"given":"Elizabeth","family":"John","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. Alper","family":"Y\u0131ld\u0131r\u0131m","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,11,9]]},"reference":[{"issue":"2","key":"9096_CR1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01586000","volume":"71","author":"E.D. Andersen","year":"1995","unstructured":"Andersen, E.D., Andersen, K.D.: Presolving in linear programming. Math. Program. 71(2), 221\u2013245 (1995)","journal-title":"Math. Program."},{"key":"9096_CR2","author":"H.Y. Benson","year":"2007","unstructured":"Benson, H.Y., Shanno, D.F.: An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming. Comput. Optim. Appl. (2007, in press). doi: 10.1007\/s10589-007-9048-6","journal-title":"Comput. Optim. Appl."},{"key":"9096_CR3","author":"H.Y. Benson","year":"2007","unstructured":"Benson, H.Y., Shanno, D.F.: Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts. Comput. Optim. Appl. (2007, in press). doi: 10.1007\/s10589-007-9089-x","journal-title":"Comput. Optim. Appl."},{"key":"9096_CR4","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1093\/imamat\/10.1.118","volume":"10","author":"A.R. Curtis","year":"1972","unstructured":"Curtis, A.R., Reid, J.K.: On the automatic scaling of matrices for Gaussian elimination. J. Inst. Math. Appl. 10, 118\u2013124 (1972)","journal-title":"J. Inst. Math. Appl."},{"issue":"1\u20134","key":"9096_CR5","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/10556789908805757","volume":"11\u20132","author":"J. Czyzyk","year":"1999","unstructured":"Czyzyk, J., Mehrotra, S., Wagner, M., Wright, S.J.: PCx: An interior-point code for linear programming. Optim. Methods Softw. 11\u20132(1\u20134), 397\u2013430 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"9096_CR6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10107-003-0469-4","volume":"100","author":"S. Elhedhli","year":"2004","unstructured":"Elhedhli, S., Goffin, J.L.: The integration of an interior-point cutting plane method within a branch-and-price algorithm. Math. Program. 100(2), 267\u2013294 (2004)","journal-title":"Math. Program."},{"key":"9096_CR7","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1287\/moor.1060.0221","volume":"31","author":"J. Fliege","year":"2006","unstructured":"Fliege, J.: An efficient interior-point method for convex multicriteria optimization problems. Math. Oper. Res. 31, 825\u2013845 (2006)","journal-title":"Math. Oper. Res."},{"key":"9096_CR8","unstructured":"Fliege, J., Heseler, A.: Constructing approximations to the efficient set of convex quadratic multiobjective problems. Technical report, Dortmund University, Dortmund, Germany (2002)"},{"key":"9096_CR9","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/0-387-33006-2_6","volume-title":"System Modeling and Optimization","author":"A. Forsgren","year":"2006","unstructured":"Forsgren, A.: On warmstarts for interior methods. In: Ceragioli, F., Dontchev, A., Furuta, H., Marti, K., Pandolfi, L. (eds.) System Modeling and Optimization. IFIP International Federation for Information Processing, vol. 199, pp. 51\u201366. Springer, Boston (2006)"},{"key":"9096_CR10","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF01582900","volume":"52","author":"R.M. Freund","year":"1991","unstructured":"Freund, R.M.: A potential function reduction algorithm for solving a linear program directly from an infeasible \u201cwarm start\u201d. Math. Program. 52, 441\u2013466 (1991)","journal-title":"Math. Program."},{"issue":"1","key":"9096_CR11","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0024-3795(91)90265-X","volume":"152","author":"R.M. Freund","year":"1991","unstructured":"Freund, R.M.: Theoretical efficiency of a shifted-barrier-function algorithm for linear programming. Linear Algebra Appl. 152(1), 19\u201341 (1991)","journal-title":"Linear Algebra Appl."},{"key":"9096_CR12","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/mnsc.38.2.284","volume":"38","author":"J.-L. Goffin","year":"1992","unstructured":"Goffin, J.-L., Haurie, A., Vial, J.-P.: Decomposition and nondifferentiable optimization with the projective algorithm. Manag. Sci. 38, 284\u2013302 (1992)","journal-title":"Manag. Sci."},{"issue":"5","key":"9096_CR13","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1080\/1055678021000060829a","volume":"17","author":"J.L. Goffin","year":"2002","unstructured":"Goffin, J.L., Vial, J.P.: Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method. Optim. Methods Softw. 17(5), 805\u2013867 (2002)","journal-title":"Optim. Methods Softw."},{"key":"9096_CR14","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00249643","volume":"6","author":"J. Gondzio","year":"1996","unstructured":"Gondzio, J.: Multiple centrality corrections in a primal-dual method for linear programming. Comput. Optim. Appl. 6, 137\u2013156 (1996)","journal-title":"Comput. Optim. Appl."},{"key":"9096_CR15","first-page":"125","volume":"83","author":"J. Gondzio","year":"1998","unstructured":"Gondzio, J.: Warm start of the primal-dual method applied in the cutting-plane scheme. Math. Program. 83, 125\u2013143 (1998)","journal-title":"Math. Program."},{"issue":"3","key":"9096_CR16","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1137\/S1052623401393141","volume":"13","author":"J. Gondzio","year":"2003","unstructured":"Gondzio, J., Grothey, A.: Re-optimization with the primal-dual interior point method. SIAM J. Optim. 13(3), 842\u2013864 (2003)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9096_CR17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1008748810765","volume":"14","author":"J. Gondzio","year":"1999","unstructured":"Gondzio, J., Vial, J.-Ph.: Warm start and epsilon-subgradients in the cutting plane scheme for block-angular linear programs. Comput. Optim. Appl. 14(1), 17\u201336 (1999)","journal-title":"Comput. Optim. Appl."},{"key":"9096_CR18","unstructured":"John, E.: Implementation of warm-start strategies in interior-point methods for linear programming. PhD thesis, Department of Applied Mathematics and Statistics, Stony Brook University (2005)"},{"key":"9096_CR19","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 373\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"9096_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","volume":"6","author":"I.J. Lustig","year":"1994","unstructured":"Lustig, I.J., Marsten, R.E., Shanno, D.F.: Interior point methods for linear programming: Computational state of the art. ORSA J. Comput. 6, 1\u201314 (1994)","journal-title":"ORSA J. Comput."},{"key":"9096_CR21","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2, 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9096_CR22","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1137\/S1052623497324242","volume":"10","author":"J.E. Mitchell","year":"2000","unstructured":"Mitchell, J.E.: Computational experience with an interior-point cutting plane algorithm. SIAM J. Optim. 10(4), 1212\u20131227 (2000)","journal-title":"SIAM J. Optim."},{"key":"9096_CR23","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF02206819","volume":"62","author":"J.E. Mitchell","year":"1996","unstructured":"Mitchell, J.E., Borchers, B.: Solving real-world linear ordering problems using a primal-dual interior point cutting plane method. Ann. Oper. Res. 62, 253\u2013276 (1996)","journal-title":"Ann. Oper. Res."},{"key":"9096_CR24","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF01580902","volume":"56","author":"J.E. Mitchell","year":"1992","unstructured":"Mitchell, J.E., Todd, M.J.: Solving combinatorial optimization problems using Karmarkar\u2019s algorithm. Math. Program. 56, 245\u2013284 (1992)","journal-title":"Math. Program."},{"key":"9096_CR25","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Point Polynomial Methods in Convex Programming","author":"Y.E. Nesterov","year":"1994","unstructured":"Nesterov, Y.E., Nemirovskii, A.S.: Interior Point Polynomial Methods in Convex Programming. SIAM, Philadelphia (1994)"},{"key":"9096_CR26","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1137\/0914063","volume":"14","author":"E. Ng","year":"1993","unstructured":"Ng, E., Peyton, B.W.: Block sparse Cholesky algorithms on advanced uniprocessor computers. SIAM J. Sci. Comput. 14, 1034\u20131056 (1993)","journal-title":"SIAM J. Sci. Comput."},{"key":"9096_CR27","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01586050","volume":"54","author":"R. Polyak","year":"1992","unstructured":"Polyak, R.: Modified barrier functions (theory and methods). Math. Program. 54, 177\u2013222 (1992)","journal-title":"Math. Program."},{"key":"9096_CR28","series-title":"MPS\/SIAM Series on Optimization","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718812","volume-title":"A Mathematical View of Interior-Point Methods in Convex Optimization","author":"J. Renegar","year":"2001","unstructured":"Renegar, J.: A Mathematical View of Interior-Point Methods in Convex Optimization. MPS\/SIAM Series on Optimization, vol.\u00a03. SIAM, Philadelphia (2001)"},{"key":"9096_CR29","first-page":"157","volume-title":"Foundations of Computational Mathematics","author":"M.J. Todd","year":"2004","unstructured":"Todd, M.J.: Detecting infeasibility in infeasible-interior-point methods for optimization. In: Cucker,\u00a0F., De Vore, R., Olver,\u00a0P. (eds.) Foundations of Computational Mathematics, pp. 157\u2013192. Cambridge University Press, Cambridge (2004)"},{"key":"9096_CR30","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"S.J. Wright","year":"1997","unstructured":"Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"issue":"4","key":"9096_CR31","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1287\/moor.28.4.649.20511","volume":"28","author":"E.A. Y\u0131ld\u0131r\u0131m","year":"2003","unstructured":"Y\u0131ld\u0131r\u0131m, E.A.: An interior-point perspective on sensitivity analysis in semidefinite programming. Math. Oper. Res. 28(4), 649\u2013676 (2003)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9096_CR32","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/PL00011423","volume":"90","author":"E.A. Y\u0131ld\u0131r\u0131m","year":"2001","unstructured":"Y\u0131ld\u0131r\u0131m, E.A., Todd, M.J.: Sensitivity analysis in linear programming and semidefinite programming using interior-point methods. Math. Program. 90(2), 229\u2013261 (2001)","journal-title":"Math. Program."},{"issue":"3","key":"9096_CR33","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/S1052623400382455","volume":"12","author":"E.A. Y\u0131ld\u0131r\u0131m","year":"2002","unstructured":"Y\u0131ld\u0131r\u0131m, E.A., Todd, M.J.: An interior-point approach to sensitivity analysis in degenerate linear programs. SIAM J. Optim. 12(3), 692\u2013714 (2002)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9096_CR34","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1137\/S1052623400369235","volume":"12","author":"E.A. Y\u0131ld\u0131r\u0131m","year":"2002","unstructured":"Y\u0131ld\u0131r\u0131m, E.A., Wright, S.J.: Warm-start strategies in interior-point methods for linear programming. SIAM J. Optim. 12(3), 782\u2013810 (2002)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9096-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9096-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9096-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:33Z","timestamp":1559302593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9096-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,9]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["9096"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9096-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,9]]}}}