{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:51:30Z","timestamp":1742975490966,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":25,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_337","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:00:04Z","timestamp":1219662004000},"page":"1886-1889","source":"Crossref","is-referenced-by-count":0,"title":["Linear Programming: Interior Point Methods"],"prefix":"10.1007","author":[{"given":"Kurt M.","family":"Anstreicher","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"337_CR1_337","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"Alizadeh F (1995) Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J Optim 5:13\u201351","journal-title":"SIAM J. Optim."},{"key":"337_CR2_337","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"E.R. Barnes","year":"1986","unstructured":"Barnes ER (1986) A\u00a0variation on Karmarkar's algorithm for solving linear programming problems. Math Program 36:174\u2013182","journal-title":"Math. Program."},{"key":"337_CR3_337","first-page":"674","volume":"8","author":"I.I. Dikin","year":"1967","unstructured":"Dikin II (1967) Iterative solution of problems of linear and quadratic programming. Soviet Math Dokl 8:674\u2013675","journal-title":"Soviet Math. Dokl."},{"key":"337_CR4_337","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971316","volume-title":"Nonlinear programming, sequential unconstrained minimization techniques","author":"A.V. Fiacco","year":"1990","unstructured":"Fiacco AV, McCormick GP (1990) Nonlinear programming, sequential unconstrained minimization techniques. SIAM, Philadelphia"},{"key":"337_CR5_337","first-page":"1","volume-title":"Progress in Mathematical Programming","author":"C.C. Gonzaga","year":"1989","unstructured":"Gonzaga CC (1989) An algorithm for solving linear programming problems in O(n3L) operations. In: Megiddo\u00a0N (ed) Progress in Mathematical Programming. Springer, Berlin, pp\u00a01\u201328"},{"key":"337_CR6_337","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01588776","volume":"49","author":"C.C. Gonzaga","year":"1991","unstructured":"Gonzaga CC (1991) Polynomial affine algorithms for linear programming. Math Program 49:7\u201321","journal-title":"Math. Program."},{"key":"337_CR7_337","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1137\/0801018","volume":"1","author":"C.C. Gonzaga","year":"1991","unstructured":"Gonzaga CC (1991) Large-step path-following methods for linear programming, Part I: Barrier function method. SIAM J Optim 1:268\u2013279","journal-title":"SIAM J. Optim."},{"key":"337_CR8_337","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar N (1984) A\u00a0new polynomial-time algorithm for linear programming. Combinatorica 4:373\u2013395","journal-title":"Combinatorica"},{"key":"337_CR9_337","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M. Kojima","year":"1993","unstructured":"Kojima M, Megiddo N, Mizuno S (1993) A\u00a0primal-dual infeasible-interior-point algorithm for linear programming. Math Program 61:263\u2013280","journal-title":"Math. Program."},{"key":"337_CR10_337","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-1-4613-9617-8_2","volume-title":"Progress in Mathematical Programming","author":"M. Kojima","year":"1989","unstructured":"Kojima M, Mizuno S, Yoshise A (1989) A\u00a0primal-dual interior point algorithm for linear programming. In: Megiddo\u00a0N (ed) Progress in Mathematical Programming. Springer, Berlin, 29\u201347"},{"key":"337_CR11_337","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"I.J. Lustig","year":"1991","unstructured":"Lustig IJ, Marsten RE, Shanno DF (1991) Computational experience with a\u00a0primal-dual interior point method for linear programming. Linear Alg Appl 152:191\u2013222","journal-title":"Linear Alg. & Its Appl."},{"key":"337_CR12_337","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1137\/S1052623493258404","volume":"7","author":"W.F. Mascarenhas","year":"1997","unstructured":"Mascarenhas WF (1997) The affine scaling algorithm fails for stepsize 0.999. SIAM J Optim 7:34\u201346","journal-title":"SIAM J. Optim."},{"key":"337_CR13_337","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-1-4613-9617-8_8","volume-title":"Progress in Mathematical Programming","author":"N. Megiddo","year":"1989","unstructured":"Megiddo N (1989) Pathways to the optimal set in linear programming. In: Megiddo N (ed) Progress in Mathematical Programming. Springer, Berlin, pp 131\u2013158"},{"key":"337_CR14_337","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"Mehrotra S (1992) On the implementation of a\u00a0primal-dual interior point method. SIAM J Optim 2:575\u2013601","journal-title":"SIAM J. Optim."},{"key":"337_CR15_337","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.C. Monteiro","year":"1989","unstructured":"Monteiro RC, Adler I (1989) Interior path following primal-dual algorithms. Part I: linear programming. Math Program 44:27\u201341","journal-title":"Math. Program."},{"key":"337_CR16_337","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-point polynomial algorithms in convex programming","author":"Y. Nesterov","year":"1994","unstructured":"Nesterov Y, Nemirovskii A (1994) Interior-point polynomial algorithms in convex programming. SIAM, Philadelphia"},{"key":"337_CR17_337","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J. Renegar","year":"1988","unstructured":"Renegar J (1988) A\u00a0polynomial-time algorithm, based on Newton's method, for linear programming. Math Program 40:59\u201393","journal-title":"Math. Program."},{"key":"337_CR18_337","first-page":"433","volume-title":"Economic Decision Making: Games, Economics, and Optimization","author":"C. Roos","year":"1990","unstructured":"Roos C, Vial J-Ph (1990) Long steps with the logarithmic penalty barrier function in linear programming. In: Gabszewicz J, Richard J-F, Wolsey L (eds) Economic Decision Making: Games, Economics, and Optimization. Elsevier, Amsterdam, pp 433\u2013441"},{"key":"337_CR19_337","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF01580859","volume":"47","author":"P.M. Vaidya","year":"1990","unstructured":"Vaidya PM (1990) An algorithm for linear programming which requires O(((m+n)n2 + (m+n)1.5n)L) arithmetic operations. Math Program 47:175\u2013201","journal-title":"Math. Program."},{"key":"337_CR20_337","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"Vandenberghe L, Boyd S (1996) Semidefinite programming. SIAM Rev 38:49\u201395","journal-title":"SIAM Rev."},{"key":"337_CR21_337","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF01840454","volume":"1","author":"R.J. Vanderbei","year":"1986","unstructured":"Vanderbei RJ, Meketon MJ, Freedman BA (1986) A\u00a0modification of Karmarkar's linear programming algorithm. Algorithmica 1:395\u2013407","journal-title":"Algorithmica"},{"key":"337_CR22_337","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02206815","volume":"62","author":"X. Xu","year":"1996","unstructured":"Xu X, Hung P-F, Ye Y (1996) A\u00a0simplified homogeneous self-dual linear programming algorithm and its implementation. Ann Oper Res 62:151\u2013171","journal-title":"Ann. Oper. Res."},{"key":"337_CR23_337","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01594937","volume":"50","author":"Y. Ye","year":"1991","unstructured":"Ye Y (1991) An O(n3L) potential reduction algorithm for linear programming. Math Program 50:239\u2013258","journal-title":"Math. Program."},{"key":"337_CR24_337","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(nL) O(\\sqrt{n}L) $$\u2010iteration homogeneous and self-dual linear programming algorithm. Math Oper Res 19:53\u201367","journal-title":"Math. Oper. Res."},{"key":"337_CR25_337","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y. Zhang","year":"1994","unstructured":"Zhang Y (1994) On the convergence of a\u00a0class of infeasible interior-point algorithms for the horizontal linear complementarity problem. SIAM J Optim 4:208\u2013227","journal-title":"SIAM J. Optim."}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T12:10:49Z","timestamp":1720699849000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_337"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_337","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}