{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T08:29:41Z","timestamp":1721550581279},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,5,18]],"date-time":"2013-05-18T00:00:00Z","timestamp":1368835200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10852-013-9227-7","type":"journal-article","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T00:07:23Z","timestamp":1368749243000},"page":"191-208","source":"Crossref","is-referenced-by-count":6,"title":["A Full-Newton Step Infeasible Interior-Point Algorithm Based on Darvay Directions for Linear Optimization"],"prefix":"10.1007","volume":"13","author":[{"given":"K.","family":"Ahmadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Hasani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Kheirfam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,18]]},"reference":[{"issue":"1","key":"9227_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1590\/S0101-82052006000100005","volume":"25","author":"M Achache","year":"2006","unstructured":"Achache, M.: A new primal-dual path-following method for convex quadratic programming. Comput. Appl. Math. 25(1), 97\u2013110 (2006)","journal-title":"Comput. Appl. Math."},{"issue":"1","key":"9227_CR2","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."},{"key":"9227_CR3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1051\/ro\/2010016","volume":"44","author":"YQ Bai","year":"2010","unstructured":"Bai, Y.Q., Wang, F.Y., Lui, X.W.: A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization. RAIRO-Oper. Res. 44, 251\u2013265 (2010)","journal-title":"RAIRO-Oper. Res."},{"issue":"1","key":"9227_CR4","first-page":"51","volume":"5","author":"Z Darvay","year":"2003","unstructured":"Darvay, Z.: New interior point algorithms in linear programming. Adv. Model. Optim. 5(1), 51\u201392 (2003)","journal-title":"Adv. Model. Optim."},{"issue":"2","key":"9227_CR5","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10957-009-9634-0","volume":"145","author":"G Gu","year":"2010","unstructured":"Gu, G., Mansouri, H., Zangiabadi, M., Bai, Y.Q., Roos, C.: Improved full-Newton step O(nL) infeasible interior-point method for linear optimization. J. Optim. Theory Appl. 145(2), 271\u2013288 (2010)","journal-title":"J. Optim. Theory Appl."},{"key":"9227_CR6","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"},{"issue":"3","key":"9227_CR7","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.: A primal-dual infeasible-interior-point algorithm for linear programming. Math. Program. Ser. A 61(3), 263\u2013280 (1993)","journal-title":"Math. Program. Ser. A"},{"key":"9227_CR8","first-page":"145","volume":"67","author":"IJ Lustig","year":"1991","unstructured":"Lustig, I.J.: Feasible issues in a primal-dual interior-point method. Math. Program. 67, 145\u2013162 (1990\/1991)","journal-title":"Math. Program."},{"key":"9227_CR9","author":"H Mansouri","year":"2012","unstructured":"Mansouri, H., Pirhaji, M.: A polynomial interior-point algorithm for monotone linear complementarity problems. J. Optim. Theory Appl. (2012). doi: 10.1007\/s10957-012-0195-2","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"9227_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01582216","volume":"67","author":"S Mizuno","year":"1994","unstructured":"Mizuno, S.: Polynomiality of infeasible-interior-point algorithms for linear programming. Math. Program. Ser. A 67(1), 109\u2013119 (1994)","journal-title":"Math. Program. Ser. A"},{"issue":"1","key":"9227_CR11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s101070200296","volume":"93","author":"J Peng","year":"2002","unstructured":"Peng, J., Roos, C., Terlaky, T.: Self-regular functions and new search directions for linear and semidefinite optimization. Math. Program. 93(1), 129\u2013171 (2002)","journal-title":"Math. Program."},{"key":"9227_CR12","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":"1","key":"9227_CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1137\/S1052623401383236","volume":"13","author":"J Peng","year":"2002","unstructured":"Peng, J., Roos, C., Terlaky, T.: Primal-dual interior-point methods for second-order conic optimization based on self-regular proximities. SIAM J. Optim. 13(1), 179\u2013203 (2002)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9227_CR14","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1137\/050623917","volume":"16","author":"C Roos","year":"2006","unstructured":"Roos, C.: A full-Newton step O(n) infeasible interior-point algorithm for linear optimization. SIAM J. Optim. 16(4), 1110\u20131136 (2006)","journal-title":"SIAM J. Optim."},{"key":"9227_CR15","volume-title":"Theory and Algorithms for Linear Optimization","author":"C Roos","year":"1997","unstructured":"Roos, C., Terlaky, T., Vial, J.-P.: Theory and Algorithms for Linear Optimization. An Interior-Point Approach. John Wiley & Sons, Chichester, UK (1997)"},{"key":"9227_CR16","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.jmaa.2008.12.016","volume":"353","author":"GQ Wang","year":"2009","unstructured":"Wang, G.Q., Bai, Y.Q.: A new primal-dual path-following interior-point algorithm for semidefinite optimization. J. Math. Anal. Appl. 353, 339\u2013349 (2009)","journal-title":"J. Math. Anal. Appl."},{"issue":"3","key":"9227_CR17","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1016\/j.amc.2009.06.034","volume":"215","author":"GQ Wang","year":"2009","unstructured":"Wang, G.Q., Bai, Y.Q.: A primal-dual path-following interior-point algorithm for second-order cone optimization with full Nesterov\u2013Todd step. Appl. Math. Comput. 215(3), 1047\u20131061 (2009)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"9227_CR18","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1007\/s10957-012-0013-x","volume":"154","author":"GQ Wang","year":"2012","unstructured":"Wang, G.Q., Bai, Y.Q.: A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization. J. Optim. Theory Appl. 154(3), 966\u2013985 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"9227_CR19","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Intrior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal-Dual Intrior-Point Methods. SIAM, Philadelphia, USA (1997)"},{"key":"9227_CR20","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. John Wiley and Sons, Chichester, UK (1997)"},{"key":"9227_CR21","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y Zhang","year":"1994","unstructured":"Zhang, Y.: On the convergence of a class of infeasible interior point methods for the horizontal linear complementary problem. SIAM J. Optim. 4, 208\u2013227 (1994)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Mathematical Modelling and Algorithms in Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-013-9227-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-013-9227-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-013-9227-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:26:33Z","timestamp":1559255193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-013-9227-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,18]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["9227"],"URL":"https:\/\/doi.org\/10.1007\/s10852-013-9227-7","relation":{},"ISSN":["2214-2487","2214-2495"],"issn-type":[{"value":"2214-2487","type":"print"},{"value":"2214-2495","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,18]]}}}