{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:04:13Z","timestamp":1762506253249},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T00:00:00Z","timestamp":1389657600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s11075-013-9772-1","type":"journal-article","created":{"date-parts":[[2014,1,13]],"date-time":"2014-01-13T04:56:39Z","timestamp":1389588999000},"page":"33-48","source":"Crossref","is-referenced-by-count":26,"title":["Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function"],"prefix":"10.1007","volume":"67","author":[{"given":"M. Reza","family":"Peyghami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Fathi","family":"Hafshejani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,14]]},"reference":[{"issue":"1","key":"9772_CR1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1137\/S1052623403423114","volume":"15","author":"YQ Bai","year":"2004","unstructured":"Bai, Y.Q., El Ghami, M., Roos, C.: A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM J. Optim. 15(1), 101\u2013128 (2004)","journal-title":"SIAM J. Optim"},{"issue":"3","key":"9772_CR2","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1137\/S1052623401398132","volume":"13","author":"YQ Bai","year":"2003","unstructured":"Bai, Y.Q., El Ghami, M., Roos, C.: A new efficient large-update primal-dual interior-point methods based on a finite barrier. SIAM J. Optim. 13(3), 766\u2013782 (2003)","journal-title":"SIAM J. Optim"},{"issue":"2","key":"9772_CR3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1051\/ro:2008009","volume":"42","author":"M El Ghami","year":"2008","unstructured":"El Ghami, M., Roos, C.: Generic primal-dual interior point methods based on a new kernel function. Int. J. RAIRO Oper. Res. 42(2), 199\u2013213 (2008)","journal-title":"Int. J. RAIRO Oper. Res"},{"key":"9772_CR4","doi-asserted-by":"crossref","first-page":"3613","DOI":"10.1016\/j.cam.2011.05.036","volume":"236","author":"M El Ghami","year":"2012","unstructured":"El Ghami, M., Guennoun, Z.A., Boula, S., Steihaug, T.: Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term. J. Comput. Appl. Math. 236, 3613\u20133623 (2012)","journal-title":"J. Comput. Appl. Math."},{"key":"9772_CR5","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF02579150","volume":"4","author":"NK Karmarkar","year":"1984","unstructured":"Karmarkar, N.K.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 375\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"9772_CR6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-1-4613-9617-8_2","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"M Kojima","year":"1989","unstructured":"Kojima, M., Mizuno, S., Yoshise, A.: A primal-dual interior point algorithm for linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming: Interior Point and Related Methods, pp. 29\u201347. Springer, New York (1989)"},{"key":"9772_CR7","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-1-4613-9617-8_8","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"N Megiddo","year":"1989","unstructured":"Megiddo, N.: Pathways to the optimal set in linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming: Interior Point and Related Methods, pp 131\u2013158. Springer, New York (1989)"},{"key":"9772_CR8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"RDC Monteiro","year":"1989","unstructured":"Monteiro, R.D.C., Adler, I.: Interior-point path following primal-dual algorithms: Part I: linear programming. Math. Program. 44, 27\u201341 (1989)","journal-title":"Math. Program."},{"key":"9772_CR9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Point Polynomial Algorithms in Convex Programming, SIAM Studies in Applied Mathematics, vol. 13","author":"YE Nesterov","year":"1994","unstructured":"Nesterov, Y.E., Nemirovskii, A.S.: Interior Point Polynomial Algorithms in Convex Programming, SIAM Studies in Applied Mathematics, vol. 13. SIAM, Philadelphia (1994)"},{"key":"9772_CR10","volume-title":"Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms","author":"J Peng","year":"2002","unstructured":"Peng, J., Roos, C., Terlaky, T.: Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms. Princeton University Press, Princeton, NJ (2002)"},{"issue":"9","key":"9772_CR11","doi-asserted-by":"crossref","first-page":"1761","DOI":"10.1007\/s10114-010-7529-5","volume":"26","author":"M Peyghami","year":"2010","unstructured":"Peyghami, M., Amini, K.: A kernel function based interior-point methods for solving P \u2217(\u03ba)-linear complementarity problem. Acta Math. Sin. (Engl. Ser.) 26(9), 1761\u20131778 (2010)","journal-title":"Acta Math. Sin. (Engl. Ser.)"},{"key":"9772_CR12","volume-title":"Theory and Algorithms for Linear Optimization: An Interior Point Approach","author":"C Roos","year":"2005","unstructured":"Roos, C., Terlaky, T., Vial, J.-Ph.: Theory and Algorithms for Linear Optimization: An Interior Point Approach. Springer, New York (2005)"},{"key":"9772_CR13","first-page":"866","volume-title":"Lecture Notes in Control and Information Sciences, vol. 84","author":"G Sonnevend","year":"1986","unstructured":"Sonnevend, G.: An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Prakopa, A., Szelezsan, J., Strazicky, B. (eds.) Lecture Notes in Control and Information Sciences, vol. 84, pp. 866\u2013876. Springer, Berlin (1986)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-013-9772-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-013-9772-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-013-9772-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:08:22Z","timestamp":1559351302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-013-9772-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,14]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["9772"],"URL":"https:\/\/doi.org\/10.1007\/s11075-013-9772-1","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,14]]}}}