{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T15:10:39Z","timestamp":1683299439400},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T00:00:00Z","timestamp":1129593600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1007\/s10589-005-3064-1","type":"journal-article","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T11:31:34Z","timestamp":1132659094000},"page":"157-185","source":"Crossref","is-referenced-by-count":5,"title":["The Complexity of Self-Regular Proximity Based Infeasible IPMs"],"prefix":"10.1007","volume":"33","author":[{"given":"Maziar","family":"Salahi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Terlaky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoqing","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,18]]},"reference":[{"key":"3064_CR1","first-page":"1","volume-title":"Numerical Linear Algebra and Optimization","author":"E.D. Andersen","year":"2004","unstructured":"E.D. Andersen, C. Roos, T. Terlaky, T. Trafalis, and J.P. Warners, \u201cThe use of low-rank updates in interior-point methods,\u201d in Numerical Linear Algebra and Optimization, Y. Yuan (Ed.), Science Press, Beijing, China, pp. 1\u201312, 2004."},{"key":"3064_CR2","unstructured":"A. Gupta, WSMP: Watson Sparse Matrix Package (Part I: Direct solution of symmetric sparce systems). Technical Report RC 21866(98462), IBM T.J. Watson Research Center, Yorktown Heights, NY, 2000. http:\/\/www.cs.umn.edu\/~agupta\/wsmp.html"},{"key":"3064_CR3","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cNew polynomial-time algorithm for linear programming,\u201d Combinatorica, vol. 4, pp. 373\u2013395, 1984.","journal-title":"Combinatorica"},{"key":"3064_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02206809","volume":"62","author":"M. Kojima","year":"1996","unstructured":"M. Kojima, \u201cBasic lemmas in polynomial-time infeasible-interior-point methods for linear programs,\u201d Annals of Operations Research, vol. 62, pp. 1\u201328, 1996.","journal-title":"Annals of Operations Research"},{"key":"3064_CR5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, N. Megiddo, and S. Mizuno, \u201cA primal-dual infeasible-interior-point algorithm for linear programming,\u201d Mathematical Programming, vol. 61, pp. 263\u2013280, 1993.","journal-title":"Mathematical Programming"},{"key":"3064_CR6","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"I.J. Lustig","year":"1993","unstructured":"I.J. Lustig, \u201cInterior point methods: Computational state of the art,\u201d Linear Algebra and Its Applications, vol. 152, pp. 191\u2013222, 1993.","journal-title":"Linear Algebra and Its Applications"},{"key":"3064_CR7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"I.J. Lustig","year":"1990\/91","unstructured":"I.J. Lustig, \u201cFeasible issues in a primal-dual interior-point methods for linear programming,\u201d Mathematical Programming, vol. 49, pp. 145\u2013162, 1990\/91.","journal-title":"Mathematical Programming"},{"key":"3064_CR8","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"S. Mehrotra, \u201cOn the implementation of a primal-dual interior point method,\u201d SIAM Journal on Optimization, vol. 2, pp. 575\u2013601, 1992.","journal-title":"SIAM Journal on Optimization"},{"key":"3064_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01582216","volume":"67","author":"S. Mizuno","year":"1994","unstructured":"S. Mizuno, \u201cPolynomiality of infeasible-interior-point algorithms for linear programming,\u201d Mathematical Programming, vol. 67, pp. 109\u2013119, 1994.","journal-title":"Mathematical Programming"},{"key":"3064_CR10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro and I. Adler, \u201cInterior path following primal-dual algorithms. Part I: Linear programming,\u201d Mathematical Programming, vol. 44, pp. 27\u201341, 1989.","journal-title":"Mathematical Programming"},{"key":"3064_CR11","unstructured":"OSL: The Optimization Solution Library. Home page: http:\/\/www-3.ibm.com\/software\/data\/bi\/index.html"},{"key":"3064_CR12","volume-title":"Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms","author":"J. Peng","year":"2002","unstructured":"J. Peng, C. Roos, and T. Terlaky, Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms. Princeton University Press: Princeton, NJ, 2002."},{"key":"3064_CR13","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1080\/1055678021000039175","volume":"17","author":"J. Peng","year":"2002","unstructured":"J. Peng and T. Terlaky, \u201cA dynamic large-update primal-dual interior-point methods for linear optimizaion,\u201d Optimization Methods and Software, vol. 17, pp. 1077\u20131104, 2002.","journal-title":"Optimization Methods and Software"},{"key":"3064_CR14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s101070200296","volume":"93","author":"J. Peng","year":"2002","unstructured":"J. Peng, C. Roos, and T. Terlaky, \u201cSelf-Regular proximities and new search directions for linear and semidefinite optimization,\u201d Mathematical Programming, vol. 93, pp. 129\u2013171, 2002.","journal-title":"Mathematical Programming"},{"key":"3064_CR15","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF01582228","volume":"67","author":"F.A. Potra","year":"1994","unstructured":"F.A. Potra, \u201cA quadratically convergence predictor-corrector method for solving linear programs from infeasible starting points,\u201d Mathematical Programming, vol. 67, pp. 383\u2013406, 1994.","journal-title":"Mathematical Programming"},{"key":"3064_CR16","volume-title":"Theory and Algorithms for Linear Optimization. An Interior Point Approach","author":"C. Roos","year":"1997","unstructured":"C. Roos, T. Terlaky, and J.-Ph. Vial, Theory and Algorithms for Linear Optimization. An Interior Point Approach. John Wiley and Sons: Chichester, UK, 1997."},{"issue":"3","key":"3064_CR17","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1137\/S1052623495282882","volume":"7","author":"D. Shanno","year":"1997","unstructured":"D. Shanno and E. Simantiraki, \u201cAn infeasible interior-point method for linear complementarity problems,\u201d SIAM Journal on Optimization, vol. 7, no. 3, pp. 620\u2013640, 1997.","journal-title":"SIAM Journal on Optimization"},{"key":"3064_CR18","doi-asserted-by":"crossref","unstructured":"J. Stoer, M. Wechs, and S. Mizuno, \u201cHigh order infeasible-interior-point methods for solving sufficient linear complementarity problems,\u201d in System Modeling and Optimization, Detroit, MI, Chapman Hall\/CRC Res. Notes Math., vol. 396, pp. 245\u2013252, 1997.","DOI":"10.1201\/9780203737422-31"},{"key":"3064_CR19","unstructured":"K. Tanabe, \u201cCentered Newton method for linear programming: Interior and \u2018exterior\u2019 point method (in Janpanese),\u201d in New Methods for Linear Programming, K. Tone (Ed.), vol. 3, pp. 98\u2013100, 1990."},{"key":"3064_CR20","doi-asserted-by":"crossref","unstructured":"T. Terlaky (Ed.), Interior Point Methods of Mathematical Programming. Kluwer Academic Publishers, 1996.","DOI":"10.1007\/978-1-4613-3449-1"},{"key":"3064_CR21","first-page":"1","volume":"81","author":"M.J. Todd","year":"1998","unstructured":"M.J. Todd and Y. Ye, \u201cApproximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming,\u201d Mathematical Programming, vol. 81, pp. 1\u201321, 1998.","journal-title":"Mathematical Programming"},{"issue":"2","key":"3064_CR22","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1137\/S105262349427409X","volume":"7","author":"P. Tseng","year":"1997","unstructured":"P. Tseng, \u201cAnalysis of an infeasible interior path-following method for complementarity problems,\u201d SIAM Journal on Optimization, vol. 7, no. 2, pp. 386\u2013402, 1997.","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"3064_CR23","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s101070050091","volume":"86","author":"R.H. T\u00fct\u00fcnc\u00fc","year":"1999","unstructured":"R.H. T\u00fct\u00fcnc\u00fc, \u201cAn infeasible-interior-point potential-reduction algorithm for linear programming,\u201d Mathematical Programming, vol. 86, no. 2, pp. 313\u2013334, 1999.","journal-title":"Mathematical Programming"},{"key":"3064_CR24","volume-title":"Primal-Dual Interior-Point Methods","author":"S.J. Wright","year":"1996","unstructured":"S.J. Wright, Primal-Dual Interior-Point Methods. SIAM: Philadelphia, 1996."},{"key":"3064_CR25","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01582211","volume":"67","author":"S.J. Wright","year":"1994","unstructured":"S.J. Wright, \u201cAn infeasible-interior-point algorithm for linear complementarity problems,\u201d Mathematical Programming,\u201d vol. 67, pp. 29\u201352, 1994.","journal-title":"Mathematical Programming"},{"issue":"3","key":"3064_CR26","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02592215","volume":"73","author":"S.J. Wright","year":"1996","unstructured":"S.J. Wright and Y. Zhang, \u201cA superquadratic infeasible-interior-point method for linear complementarity problems,\u201d Mathematical Programming, vol. 73, no. 3, pp. 269\u2013289, 1996.","journal-title":"Mathematical Programming"},{"key":"3064_CR27","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior-Point Algorithms, Theory and Analysis","author":"Y. Ye","year":"1997","unstructured":"Y. Ye, Interior-Point Algorithms, Theory and Analysis. John Wiley & Sons: Chichester, UK, 1997."},{"key":"3064_CR28","doi-asserted-by":"crossref","unstructured":"Y. Ye, M.J. Todd, and S. Mizuno, \u201cAn $$O(\\sqrt{n}L$$ )-iteration homogeneous and self-dual linear programming algorithm,\u201d Mathematics of Operations Research, vol. 19, pp. 53\u201367, 1994.","DOI":"10.1287\/moor.19.1.53"},{"key":"3064_CR29","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y. Zhang","year":"1994","unstructured":"Y. Zhang, \u201cOn the convergence of a class of infeasible-interior-point methods for the horizantal linear complementarity problem,\u201d SIAM Journal on Optimization, vol. 4, pp. 208\u2013227, 1994.","journal-title":"SIAM Journal on Optimization"},{"key":"3064_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10556789808805699","volume":"10","author":"Y. Zhang","year":"1999","unstructured":"Y. Zhang, \u201cSolving large-scale linear programs by interior-point methods under the MATLAB environment,\u201d Optimization Methods and Software, vol. 10, pp. 1\u201331, 1999.","journal-title":"Optimization Methods and Software"},{"key":"3064_CR31","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1080\/10556789908805756","volume":"11\/12","author":"Y. Zhang","year":"1999","unstructured":"Y. Zhang, \u201cUser's Guide to LIPSOL Linear-programming Interior Point Solvers V0.4.\u201d, Optimization Methods and Software, vol. 11\/12, pp. 385\u2013396, 1999.","journal-title":"Optimization Methods and Software"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3064-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-3064-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3064-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T14:42:37Z","timestamp":1683297757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-3064-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,18]]},"references-count":31,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["3064"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-3064-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,18]]}}}