{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T04:06:34Z","timestamp":1771819594189,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,8,19]],"date-time":"2012-08-19T00:00:00Z","timestamp":1345334400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s12532-012-0046-z","type":"journal-article","created":{"date-parts":[[2012,8,18]],"date-time":"2012-08-18T08:25:57Z","timestamp":1345278357000},"page":"1-25","source":"Crossref","is-referenced-by-count":27,"title":["Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems"],"prefix":"10.1007","volume":"5","author":[{"given":"Anders","family":"Skajaa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erling D.","family":"Andersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,19]]},"reference":[{"key":"46_CR1","first-page":"197","volume-title":"High Performance Optimization","author":"E.D. Andersen","year":"1999","unstructured":"Andersen E.D., Andersen K.D.: The MOSEK interior point optimization for linear programming: an implementation of the homogeneous algorithm. In: Frenk, H., Roos, K., Terlaky, T., Zhang, S. (eds.) High Performance Optimization, pp. 197\u2013232. Kluwer, Dordrecht (1999)"},{"issue":"2","key":"46_CR2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10107-002-0349-3","volume":"95","author":"E.D. Andersen","year":"2003","unstructured":"Andersen E.D., Roos C., Terlaky T.: On implementing a primal-dual interior-point method for conic quadratic optimization. Math. Program. 95(2), 249\u2013277 (2003)","journal-title":"Math. Program."},{"key":"46_CR3","unstructured":"Andersen, E.D.: Handling free variables in primal-dual interior-point methods using a quadratic cone. Available from http:\/\/www.mendeley.com\/c\/4812865462\/p\/11467401\/andersen-2002-handling-free-variables-in-methods-using-a-quadratic-cone (2002)"},{"issue":"2","key":"46_CR4","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":"46_CR5","unstructured":"Andersen, E.D., Dahl, J., Friberg, H.A.: Markowitz portfolio optimization using MOSEK. MOSEK Technical report: TR-2009-2 (2011)"},{"key":"46_CR6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10589-007-9048-6","volume":"38","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. 38, 371\u2013399 (2007)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"46_CR7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-009-0290-9","volume":"127","author":"M. Colombo","year":"2011","unstructured":"Colombo M., Gondzio J., Grothey A.: A warm-start approach for large-scale stochastic linear programs. Math. Program. 127(2), 371\u2013397 (2011)","journal-title":"Math. Program."},{"issue":"4","key":"46_CR8","doi-asserted-by":"crossref","first-page":"1828","DOI":"10.1137\/080742786","volume":"20","author":"A. Engau","year":"2010","unstructured":"Engau A., Anjos M.F., Vannelli A.: On interior-point warmstarts for linear and combinatorial optimization. SIAM J. Optim. 20(4), 1828\u20131861 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"46_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.28.1.1.14260","volume":"28","author":"D. Goldfarb","year":"2003","unstructured":"Goldfarb D., Iyengar G.: Robust portfolio selection problems. Math. Oper. Res. 28(1), 1\u201338 (2003)","journal-title":"Math. Oper. Res."},{"key":"46_CR10","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1137\/S1052623401393141","volume":"13","author":"J. Gondzio","year":"2002","unstructured":"Gondzio J., Grothey A.: Reoptimization with the primal-dual interior point method. SIAM J. Optim. 13, 842\u2013864 (2002)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"46_CR11","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1137\/060678129","volume":"19","author":"J. Gondzio","year":"2008","unstructured":"Gondzio J., Grothey A.: A new unblocking technique to warmstart interior point methods based on sensitivity analysis. SIAM J. Optim. 19(3), 1184\u20131210 (2008)","journal-title":"SIAM J. Optim."},{"key":"46_CR12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10589-007-9096-y","volume":"41","author":"E. John","year":"2008","unstructured":"John E., Yildirim E.A.: Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension. Comput. Optim. Appl. 41, 151\u2013183 (2008)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"46_CR13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1080\/10556780008805800","volume":"14","author":"Z.Q. Luo","year":"2000","unstructured":"Luo Z.Q., Sturm J.F., Zhang S.: Conic convex programming and self-dual embedding. Optim. Methods Softw. 14(3), 169\u2013218 (2000)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"46_CR14","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), 1\u201314 (1994)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"46_CR15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/ijoc.3.1.63","volume":"3","author":"N. Megiddo","year":"1991","unstructured":"Megiddo N.: On finding primal- and dual-optimal bases. ORSA J. Comput. 3(1), 63\u201365 (1991)","journal-title":"ORSA J. Comput."},{"issue":"4","key":"46_CR16","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(4), 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"46_CR17","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S. Mizuno","year":"1993","unstructured":"Mizuno S., Todd M.J., Ye Y.: On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18(4), 964\u2013981 (1993)","journal-title":"Math. Oper. Res."},{"key":"46_CR18","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y.E. Nesterov","year":"1994","unstructured":"Nesterov Y.E., Nemirovski A.S.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia, PA (1994)"},{"issue":"1","key":"46_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"Y.E. Nesterov","year":"1997","unstructured":"Nesterov Y.E., Todd M.J.: Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22(1), 1\u201342 (1997)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"46_CR20","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1137\/S1052623495290209","volume":"8","author":"Y.E. Nesterov","year":"1998","unstructured":"Nesterov Y.E., Todd M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8(2), 324\u2013364 (1998)","journal-title":"SIAM J. Optim."},{"key":"46_CR21","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":"46_CR22","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"12","author":"J.F. Sturm","year":"1999","unstructured":"Sturm J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 12, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"6","key":"46_CR23","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1080\/1055678021000045123","volume":"17","author":"J.F. Sturm","year":"2002","unstructured":"Sturm J.F.: Implementation of interior point methods for mixed semidefinite and second order cone optimization problems. Optim. Methods Softw. 17(6), 1105\u20131154 (2002)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"46_CR24","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1287\/moor.23.3.708","volume":"23","author":"L. Tuncel","year":"1998","unstructured":"Tuncel L.: Primal-dual symmetry and scale invariance of interior-point algorithms for convex optimization. Math. Oper. Res. 23(3), 708\u2013718 (1998)","journal-title":"Math. Oper. Res."},{"key":"46_CR25","volume-title":"Primal-Dual Interior-Point Methods","author":"S.J. Wright","year":"1987","unstructured":"Wright S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia, PA (1987)"},{"issue":"4","key":"46_CR26","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1137\/S1052623496304712","volume":"9","author":"S.J. Wright","year":"1999","unstructured":"Wright S.J.: Modified cholesky factorizations in interior-point algorithms for linear programming. SIAM J. Optim. 9(4), 1159\u20131191 (1999)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"46_CR27","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02206815","volume":"62","author":"X. Xu","year":"1996","unstructured":"Xu X., Hung P.F., Ye Y.: A simplified homogeneous and self-dual linear programming algorithm and its implementation. Ann. Oper. Res. 62(1), 151\u2013171 (1996)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"46_CR28","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y. Ye","year":"1994","unstructured":"Ye Y., Todd M.J., Mizuno S.: An O(sqrt(n)L)-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19(1), 53\u201367 (1994)","journal-title":"Math. Oper. Res."},{"key":"46_CR29","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms: Theory and Analysis","author":"Y. Ye","year":"1997","unstructured":"Ye Y.: Interior Point Algorithms: Theory and Analysis. Wiley-Interscience, New York (1997)"},{"issue":"3","key":"46_CR30","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1137\/S1052623400369235","volume":"12","author":"E.A. Yildirim","year":"2002","unstructured":"Yildirim 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":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-012-0046-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-012-0046-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-012-0046-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T12:15:57Z","timestamp":1559477757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-012-0046-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,19]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["46"],"URL":"https:\/\/doi.org\/10.1007\/s12532-012-0046-z","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,19]]}}}