{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:25:20Z","timestamp":1649193920239},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,12,28]],"date-time":"2013-12-28T00:00:00Z","timestamp":1388188800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10100-013-0336-1","type":"journal-article","created":{"date-parts":[[2013,12,27]],"date-time":"2013-12-27T01:42:12Z","timestamp":1388108532000},"page":"913-924","source":"Crossref","is-referenced-by-count":4,"title":["The practical behavior of the homogeneous self-dual formulations in interior point methods"],"prefix":"10.1007","volume":"23","author":[{"given":"Csaba","family":"Meszaros","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,28]]},"reference":[{"key":"336_CR1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1023\/A:1018369223322","volume":"10","author":"ED Andersen","year":"1998","unstructured":"Andersen ED, Ye Y (1998) A computational study of the homogeneous algorithm for large-scale convex optimization. Comput Optim Appl 10:243\u2013289","journal-title":"Comput Optim Appl"},{"issue":"2","key":"336_CR2","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s101070050027","volume":"84","author":"ED Andersen","year":"1999","unstructured":"Andersen ED, Ye Y (1999) On a homogeneous algorithm for the monotone complementarity problem. Math Program 84(2):375\u2013399","journal-title":"Math Program"},{"key":"336_CR3","doi-asserted-by":"crossref","unstructured":"Andersen ED, Gondzio J, Meszaros C, Xu X (1996) Implementation of interior point methods for large scale linear programs. In: Terlaky T (ed) Interior point methods of mathematical programming. Kluwer, Dordrecht, pp 189\u2013252","DOI":"10.1007\/978-1-4613-3449-1_6"},{"key":"336_CR4","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1080\/10556789408805570","volume":"3","author":"KM Anstreicher","year":"1994","unstructured":"Anstreicher KM, Vial J-P (1994) On the convergence of an infeasible primal-dual interior-point method for convex programming. Optim Methods Softw 3:285\u2013316","journal-title":"Optim Methods Softw"},{"key":"336_CR5","first-page":"10","volume":"13","author":"DM Gay","year":"1985","unstructured":"Gay DM (1985) Electronic mail distribution of linear programming test problems. COAL Newsl 13:10\u201312","journal-title":"COAL Newsl"},{"key":"336_CR6","doi-asserted-by":"crossref","unstructured":"Goldman AJ, Tucker AW (1956a) Polyhedral convex cones. In: Kuhn HW, Tucker AW (eds) Linear inequalities and related systems. Princeton University Press, Princeton, NJ, pp 19\u201340","DOI":"10.1515\/9781400881987-003"},{"key":"336_CR7","doi-asserted-by":"crossref","unstructured":"Goldman AJ, Tucker AW (1956b) Theory of linear programming. In: Kuhn HW, Tucker AW (eds) Linear inequalities and related systems. Princeton University Press, Princeton, NJ, pp 53\u201397","DOI":"10.1515\/9781400881987-005"},{"key":"336_CR8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00249643","volume":"6","author":"J Gondzio","year":"1996","unstructured":"Gondzio J (1996) Multiple centrality corrections in a primal-dual method for linear programming. Comput Optim Appl 6:137\u2013156","journal-title":"Comput Optim Appl"},{"key":"336_CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1080\/02331939408843952","volume":"29","author":"B Jansen","year":"1994","unstructured":"Jansen B, Terlaky T, Roos C (1994) The theory of linear programming: skew symmetric self-dual problems and the central path. Optimization 29:225\u2013233","journal-title":"Optimization"},{"key":"336_CR10","unstructured":"Kojima M, Megiddo N, Mizuno S (1991) A primal-dual infeasible-interior-point algorithm for linear programming, Technical report"},{"key":"336_CR11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M Kojima","year":"1993","unstructured":"Kojima M, Megiddo N, Mizuno S (1993) A primal-dual infeasible-interior-point algorithm for linear programming. Math Program 61:263\u2013280","journal-title":"Math Program"},{"key":"336_CR12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"IJ Lustig","year":"1990","unstructured":"Lustig IJ (1990) Feasibility issues in primal-dual interior-point methods for linear programming. Math Program 49:145\u2013162","journal-title":"Math Program"},{"issue":"3","key":"336_CR13","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1137\/0802022","volume":"2","author":"IJ Lustig","year":"1992","unstructured":"Lustig IJ, Marsten RE, Shanno DF (1992) On implementing Mehrotra\u2019s predictor-corrector interior-point method for linear programming. SIAM J Optim 2(3):435\u2013449","journal-title":"SIAM J Optim"},{"issue":"1","key":"336_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","volume":"6","author":"IJ Lustig","year":"1994","unstructured":"Lustig IJ, Marsten RE, Shanno DF (1994) Interior point methods for linear programming: computational state of the art. ORSA J Comput 6(1):1\u201315","journal-title":"ORSA J Comput"},{"key":"336_CR15","unstructured":"Mehrotra S (1991) High order methods and their performance. Technical Report 90\u201316R1, Department of Industrial Engineering and Managment Sciences Northwestern University, Evanston, USA"},{"key":"336_CR16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1080\/10556789808805689","volume":"9","author":"C M\u00e9sz\u00e1ros","year":"1997","unstructured":"M\u00e9sz\u00e1ros C (1997) On free variables in interior point methods. Optim Methods Softw 9:121\u2013139","journal-title":"Optim Methods Softw"},{"key":"336_CR17","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1080\/10556789908805758","volume":"11 &12","author":"C M\u00e9sz\u00e1ros","year":"1999","unstructured":"M\u00e9sz\u00e1ros C (1999) The BPMPD interior-point solver for convex quadratic problems. Optim Methods Softw 11 &12:431\u2013449","journal-title":"Optim Methods Softw"},{"key":"336_CR18","doi-asserted-by":"crossref","unstructured":"M\u00e9sz\u00e1ros C (2005) On the Cholesky factorization in interior point methods. Comput Math Appl 50: 1157\u20131166","DOI":"10.1016\/j.camwa.2005.08.016"},{"issue":"1","key":"336_CR19","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/050633354","volume":"30","author":"C M\u00e9sz\u00e1ros","year":"2008","unstructured":"M\u00e9sz\u00e1ros C (2008) On numerical issues of interior point methods. SIAM J Matrix Anal 30(1):223\u2013235","journal-title":"SIAM J Matrix Anal"},{"issue":"3","key":"336_CR20","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1080\/10556780903239410","volume":"25","author":"C M\u00e9sz\u00e1ros","year":"2010","unstructured":"M\u00e9sz\u00e1ros C (2010) On the implementation of interior point methods for dual-core platforms. Optim Mathods Softw 25(3):449\u2013456","journal-title":"Optim Mathods Softw"},{"key":"336_CR21","unstructured":"M\u00e9sz\u00e1ros C (2011a) On sparse matrix orderings in interior point methods. Working paper, Computer and Automation Institute, Hungarian Academy of Sciences, Budapest"},{"issue":"3","key":"336_CR22","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1080\/10556788.2010.544309","volume":"26","author":"C M\u00e9sz\u00e1ros","year":"2011","unstructured":"M\u00e9sz\u00e1ros C (2011b) Solving quadratically constrained convex optimization problems with an interior point method. Optim Methods Softw 26(3):421\u2013429","journal-title":"Optim Methods Softw"},{"key":"336_CR23","doi-asserted-by":"crossref","unstructured":"M\u00e9sz\u00e1ros C (2012) Regularization techniques in interior point methods. J Comput Appl Math 236: 3704\u20133709","DOI":"10.1016\/j.cam.2011.07.012"},{"key":"336_CR24","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/s00291-003-0130-x","volume":"25","author":"C M\u00e9sz\u00e1ros","year":"2004","unstructured":"M\u00e9sz\u00e1ros C, Suhl UH (2004) Advanced preprocessing techniques for linear and quadratic programming. OR Spectrum 25:575\u2013595","journal-title":"OR Spectrum"},{"key":"336_CR25","unstructured":"Mittelmann HD, Spellucci P (1998)Decision tree for optimization software. World Wide Web. http:\/\/plato.la.asu.edu\/guide.html"},{"key":"336_CR26","doi-asserted-by":"crossref","unstructured":"Mizuno S (1994) Polynomiality of infeasible-interior-point algorithms for linear programming. Math Program 67(1):109\u2013119","DOI":"10.1007\/BF01582216"},{"key":"336_CR27","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/PL00011413","volume":"89","author":"S Mizuno","year":"2001","unstructured":"Mizuno S, Todd MJ (2001) On two homogeneous self-dual approaches to linear programming and its extensions. Math Program 89:517\u2013534","journal-title":"Math Program"},{"key":"336_CR28","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10107980009a","volume":"84","author":"Y Nesterov","year":"1999","unstructured":"Nesterov Y, Todd MJ, Ye Y (1999) Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems. Math Program 84:227\u2013267","journal-title":"Math Program"},{"key":"336_CR29","unstructured":"Tucker AW (1956) Dual systems of homogeneous linear relations. In: Kuhn HW, Tucker AW (eds) Linear inequalities and related systems. Princeton University Press, Princeton, NJ, pp 3\u201318"},{"issue":"1","key":"336_CR30","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0805005","volume":"5","author":"RJ Vanderbei","year":"1995","unstructured":"Vanderbei RJ (1995) Symmetric quasi-definite matrices. SIAM J Optim 5(1):100\u2013113","journal-title":"SIAM J Optim"},{"key":"336_CR31","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1090\/qam\/135625","volume":"19","author":"P Wolfe","year":"1961","unstructured":"Wolfe P (1961) A duality theorem for non-linear programming. Q Appl Math 19:239\u2013244","journal-title":"Q Appl Math"},{"issue":"4","key":"336_CR32","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1137\/S1052623496304712","volume":"9","author":"SJ Wright","year":"1999","unstructured":"Wright SJ (1999) Modified Cholesky factorizations in interior-point algorithms for linear programming. SIAM J Optim 9(4):1159\u20131191","journal-title":"SIAM J Optim"},{"key":"336_CR33","unstructured":"Xu X (August 1994) An $${\\cal O}(\\sqrt{n} L)$$ O ( n L ) -iteration large-step infeasible path-following algorithm for linear programming. Technical report, College of Business Administration, The University of Iowa, Iowa City, IA 52242"},{"issue":"2","key":"336_CR34","first-page":"155","volume":"76","author":"X Xu","year":"1996","unstructured":"Xu X (1996) On the implementation of a homogeneous and self-dual linear programming algorithm. Math Program 76(2):155\u2013181","journal-title":"Math Program"},{"key":"336_CR35","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0167-6377(95)00002-2","volume":"17","author":"X Xu","year":"1995","unstructured":"Xu X, Ye Y (1995) A generalized homogeneous and self-dual algorithm for linear programming. Oper Res Lett 17:181\u2013190","journal-title":"Oper Res Lett"},{"issue":"1","key":"336_CR36","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 (1996) A simplified homogeneous and self-dual linear programming algorithm and its implementation. Ann Oper Res 62(1):151\u2013171","journal-title":"Ann Oper Res"},{"key":"336_CR37","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 MJ, Mizuno S (1994) An $$O(\\sqrt{n} L)$$ O ( n L ) -iteration homogeneous and self-dual linear programming algorithm. Math Oper Res 19:53\u201367","journal-title":"Math Oper Res"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-013-0336-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-013-0336-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-013-0336-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T06:53:02Z","timestamp":1564987982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-013-0336-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,28]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["336"],"URL":"https:\/\/doi.org\/10.1007\/s10100-013-0336-1","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,28]]}}}