{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:46:47Z","timestamp":1761896807197,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T00:00:00Z","timestamp":1528329600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministry of Research and Innovation, CNCS - UEFISCDI","award":["PN-III-P4-ID-PCE-2016-0190, within PNCDI III"],"award-info":[{"award-number":["PN-III-P4-ID-PCE-2016-0190, within PNCDI III"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10589-018-0012-4","type":"journal-article","created":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T02:46:15Z","timestamp":1528339575000},"page":"483-508","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier"],"prefix":"10.1007","volume":"71","author":[{"given":"Petra Ren\u00e1ta","family":"Rig\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1094-9837","authenticated-orcid":false,"given":"Zsolt","family":"Darvay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,7]]},"reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10852-013-9227-7","volume":"13","author":"K Ahmadi","year":"2014","unstructured":"Ahmadi, K., Hasani, F., Kheirfam, B.: A full-Newton step infeasible interior-point algorithm based on Darvay directions for linear optimization. J. Math. Model. Algorithms Oper. Res. 13(2), 191\u2013208 (2014)","journal-title":"J. Math. Model. Algorithms Oper. Res."},{"issue":"1","key":"12_CR2","first-page":"37","volume":"22","author":"S Asadi","year":"2014","unstructured":"Asadi, S., Mansouri, H.: A new full-Newton step $${O}(n)$$ O ( n ) infeasible interior-point algorithm for $${P}_*(\\kappa )$$ P \u2217 ( \u03ba ) -horizontal linear complementarity problems. Comput. Sci. J. Mold. 22(1), 37\u201361 (2014)","journal-title":"Comput. Sci. J. Mold."},{"key":"12_CR3","unstructured":"Darvay, Zs.: New interior point algorithms in linear programming. Adv. Model. Optim. 5(1), 51\u201392 (2003)"},{"key":"12_CR4","unstructured":"Darvay, Zs., Papp, I.M., Tak\u00e1cs, P.R.: An infeasible full-Newton step algorithm for linear optimization with one centering step in major iteration. Studia Univ. Babe\u015f-Bolyai Ser. Inform. 59(1), 28\u201345 (2014)"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10998-016-0119-2","volume":"73","author":"Zsolt Darvay","year":"2016","unstructured":"Darvay, Zs., Papp, I.M., Tak\u00e1cs, P.R.: Complexity analysis of a full-Newton step interior-point method for linear optimization. Period. Math. Hung. 73(1), 27\u201342 (2016)","journal-title":"Periodica Mathematica Hungarica"},{"key":"12_CR6","unstructured":"Darvay, Zs., Tak\u00e1cs, P.R.: New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function. Operations Research Report, 2016-01, E\u00f6tv\u00f6s Lor\u00e1nd University of Sciences, Budapest (2016)"},{"issue":"5","key":"12_CR7","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0167-6377(97)00011-4","volume":"20","author":"E Klerk de","year":"1997","unstructured":"de Klerk, E., Roos, C., Terlaky, T.: Initialization in semidefinite programming via a self-dual, skew-symmetric embedding. Oper. Res. Lett. 20(5), 213\u2013221 (1997)","journal-title":"Oper. Res. Lett."},{"key":"12_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/b105286","volume-title":"Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications","author":"E Klerk de","year":"2002","unstructured":"de Klerk, E.: Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"12_CR9","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534778.001.0001","volume-title":"Analysis on Symmetric Cones","author":"J Faraut","year":"1994","unstructured":"Faraut, J., Kor\u00e1nyi, A.: Analysis on Symmetric Cones. Oxford University Press, New York (1994)"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0377-0427(97)00153-2","volume":"86","author":"L Faybusovich","year":"1997","unstructured":"Faybusovich, L.: Linear systems in Jordan algebras and primal-dual interior-point algorithms. J. Comput. Appl. Math. 86(1), 149\u2013175 (1997)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s002090100286","volume":"239","author":"L Faybusovich","year":"2002","unstructured":"Faybusovich, L.: A Jordan-algebraic approach to potential-reduction algorithms. Math. Z. 239(1), 117\u2013129 (2002)","journal-title":"Math. Z."},{"key":"12_CR12","first-page":"10","volume":"3","author":"D Gay","year":"1985","unstructured":"Gay, D.: Electronic mail distribution of linear programming test problems. Math. Program. Soc. COAL Newsl. 3, 10\u201312 (1985)","journal-title":"Math. Program. Soc. COAL Newsl."},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.ejor.2011.02.022","volume":"214","author":"G Gu","year":"2011","unstructured":"Gu, G., Zangiabadi, M., Roos, C.: Full Nesterov\u2013Todd step infeasible interior-point method for symmetric optimization. Eur. J. Oper. Res. 214(3), 473\u2013484 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1287\/moor.21.4.860","volume":"21","author":"O G\u00fcler","year":"1996","unstructured":"G\u00fcler, O.: Barrier functions in interior point methods. Math. Oper. Res. 21(4), 860\u2013885 (1996)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10957-008-9440-0","volume":"140","author":"T Ill\u00e9s","year":"2009","unstructured":"Ill\u00e9s, T., Nagy, M., Terlaky, T.: EP theorem for dual linear complementarity problems. J. Optim. Theory Appl. 140(2), 233\u2013238 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10898-008-9348-0","volume":"47","author":"T Ill\u00e9s","year":"2010","unstructured":"Ill\u00e9s, T., Nagy, M., Terlaky, T.: A polynomial path-following interior point algorithm for general linear complementarity problems. J. Global Optim. 47(3), 329\u2013342 (2010)","journal-title":"J. Global Optim."},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10479-013-1474-5","volume":"211","author":"B Kheirfam","year":"2013","unstructured":"Kheirfam, B.: A new infeasible interior-point method based on Darvay\u2019s technique for symmetric optimization. Ann. Oper. Res. 211(1), 209\u2013224 (2013)","journal-title":"Ann. Oper. Res."},{"key":"12_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54509-3","volume-title":"A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Lecture Notes in Computer Science","author":"M Kojima","year":"1991","unstructured":"Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Lecture Notes in Computer Science, vol. 538. Springer, Berlin (1991)"},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1080\/10556780802571392","volume":"25","author":"MH Koulaei","year":"2010","unstructured":"Koulaei, M.H., Terlaky, T.: On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization. Optim. Methods Sofw. 25(3), 467\u2013485 (2010)","journal-title":"Optim. Methods Sofw."},{"issue":"6","key":"12_CR20","doi-asserted-by":"publisher","first-page":"2853","DOI":"10.1137\/080729311","volume":"20","author":"Y Li","year":"2010","unstructured":"Li, Y., Terlaky, T.: A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with $${O}\\left(\\sqrt{n}\\log \\frac{\\rm {T}r(x^0s^0)}{\\epsilon }\\right)$$ O n log T r ( x 0 s 0 ) \u03f5 iteration complexity. SIAM J. Optim. 20(6), 2853\u20132875 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1\u20133","key":"12_CR21","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"I Lustig","year":"1990","unstructured":"Lustig, I.: Feasibility issues in a primal-dual interior-point method for linear programming. Math. Program. 49(1\u20133), 145\u2013162 (1990)","journal-title":"Math. Program."},{"issue":"4","key":"12_CR22","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"12_CR23","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01580085","volume":"81","author":"R Monteiro","year":"1998","unstructured":"Monteiro, R., Zhang, Y.: A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming. Math. Program. 81(3), 281\u2013299 (1998)","journal-title":"Math. Program."},{"key":"12_CR24","volume-title":"Interior Point Polynomial Methods in Convex Programming, SIAM Studies in Applied Mathematics","author":"YE Nesterov","year":"1994","unstructured":"Nesterov, Y.E., Nemirovskii, A.S.: Interior Point Polynomial Methods in Convex Programming, SIAM Studies in Applied Mathematics, vol. 13. SIAM Publications, Philadelphia (1994)"},{"issue":"1","key":"12_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"YE Nesterov","year":"1997","unstructured":"Nesterov, Y.E., Todd, M.J.: Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22(1), 1\u201342 (1997)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"12_CR26","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1137\/S1052623495290209","volume":"8","author":"YE Nesterov","year":"1998","unstructured":"Nesterov, Y.E., Todd, M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8(2), 324\u2013364 (1998)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"12_CR27","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/j.jmaa.2005.04.028","volume":"314","author":"S Pan","year":"2006","unstructured":"Pan, S., Li, X., He, S.: An infeasible primal-dual interior-point algorithm for linear programs based on logarithmic equivalent transformation. J. Math. Anal. Appl. 314(2), 644\u2013660 (2006)","journal-title":"J. Math. Anal. Appl."},{"key":"12_CR28","unstructured":"Pataki, G., Schmieta, S.: The DIMACS library of mixed semidefinite-quadratic-linear programs. http:\/\/dimacs.rutgers.edu\/Challenges\/Seventh\/Instances\/ (1999). Accessed 5 June 2018"},{"issue":"4","key":"12_CR29","first-page":"61","volume":"6","author":"J Peng","year":"2001","unstructured":"Peng, J., Roos, C., Terlaky, T.: A new and efficient large-update interior-point method for linear optimization. J. Comput. Technol. 6(4), 61\u201380 (2001)","journal-title":"J. Comput. Technol."},{"key":"12_CR30","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/S0377-2217(02)00275-8","volume":"143","author":"J Peng","year":"2002","unstructured":"Peng, J., Roos, C., Terlaky, T.: A new class of polynomial primal-dual methods for linear and semidefinite optimization. Eur. J. Oper. Res. 143, 234\u2013256 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"12_CR31","doi-asserted-by":"publisher","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."},{"key":"12_CR32","volume-title":"Self-Regular Functions: A New Paradigm for Primal-Dual Interior-Point Methods","author":"J Peng","year":"2002","unstructured":"Peng, J., Roos, C., Terlaky, T.: Self-Regular Functions: A New Paradigm for Primal-Dual Interior-Point Methods. Princeton University Press, Princeton (2002)"},{"issue":"4","key":"12_CR33","doi-asserted-by":"publisher","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":"12_CR34","volume-title":"Theory and Algorithms for Linear Optimization","author":"C Roos","year":"2005","unstructured":"Roos, C., Terlaky, T., Vial, J.P.: Theory and Algorithms for Linear Optimization. Springer, New York (2005)"},{"key":"12_CR35","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-1-4614-0769-0_15","volume-title":"Handbook on Semidefinite, Conic and Polynomial Optimization","author":"M Salahi","year":"2012","unstructured":"Salahi, M., Terlaky, T.: Self-regular interior-point methods for semidefinite optimization. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, pp. 437\u2013454. Springer, Berlin (2012)"},{"key":"12_CR36","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10589-005-3064-1","volume":"33","author":"M Salahi","year":"2006","unstructured":"Salahi, M., Terlaky, T., Zhang, G.: The complexity of self-regular proximity based infeasible IPMs. Comput. Optim. Appl. 33, 157\u2013185 (2006)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"12_CR37","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10107-003-0380-z","volume":"96","author":"S Schmieta","year":"2003","unstructured":"Schmieta, S., Alizadeh, F.: Extension of primal-dual interior point algorithms to symmetric cones. Math. Program. Ser. A 96(3), 409\u2013438 (2003)","journal-title":"Math. Program. Ser. A"},{"key":"12_CR38","doi-asserted-by":"crossref","unstructured":"Sonnevend, G.: An \u201canalytic center\u201d for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Pr\u00e9kopa, A., Szelezs\u00e1n, J., Strazicky, B. (eds.) System Modelling and Optimization: Proceedings of the 12th IFIP-Conference Held in Budapest, Hungary, September 1985, Lecture Notes in Control and Information Sciences, vol. 84, pp. 866\u2013876. Springer, Berlin, West-Germany (1986)","DOI":"10.1007\/BFb0043914"},{"issue":"13","key":"12_CR39","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0024-3795(00)00096-3","volume":"312","author":"JF Sturm","year":"2000","unstructured":"Sturm, J.F.: Similarity and other spectral relations for symmetric cones. Linear Algebra Appl. 312(13), 135\u2013154 (2000)","journal-title":"Linear Algebra Appl."},{"key":"12_CR40","unstructured":"Tanabe, K.: Centered Newton method for linear programming: interior and \u2018exterior\u2019 point method. In: Tone, K. (ed.) New Methods for Linear Programming, vol. 3, pp. 98\u2013100. The Institute of Statistical Mathematics, Tokyo, Japan (1990) (In Japanese)"},{"key":"12_CR41","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., Tutuncu, R.H.: SDPT3\u2014a Matlab software package for semidefinite programming. Optim. Methods Sofw. 11, 545\u2013581 (1999)","journal-title":"Optim. Methods Sofw."},{"key":"12_CR42","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH Tutuncu","year":"2003","unstructured":"Tutuncu, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. Ser. B 95, 189\u2013217 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"12_CR43","unstructured":"Vieira, M.: Jordan algebraic approach to symmetric optimization. Ph.D. thesis, Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, The Netherlands (2007)"},{"issue":"3","key":"12_CR44","doi-asserted-by":"publisher","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\u2013Todd 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":"12_CR45","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"S Wright","year":"1997","unstructured":"Wright, S.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"key":"12_CR46","doi-asserted-by":"publisher","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. Wiley, Chichester (1997)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-0012-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0012-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0012-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T09:42:34Z","timestamp":1720345354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-0012-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,7]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["12"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-0012-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2018,6,7]]},"assertion":[{"value":"3 April 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}