{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:29:13Z","timestamp":1761895753822},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,10,25]],"date-time":"2013-10-25T00:00:00Z","timestamp":1382659200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10479-013-1474-5","type":"journal-article","created":{"date-parts":[[2013,10,24]],"date-time":"2013-10-24T06:59:15Z","timestamp":1382597955000},"page":"209-224","source":"Crossref","is-referenced-by-count":16,"title":["A new infeasible interior-point method based on Darvay\u2019s technique for symmetric optimization"],"prefix":"10.1007","volume":"211","author":[{"given":"Behrouz","family":"Kheirfam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,25]]},"reference":[{"issue":"1","key":"1474_CR1","first-page":"51","volume":"5","author":"Z. Darvay","year":"2003","unstructured":"Darvay, Z. (2003). New interior point algorithms in linear programming. Advanced Modelling and Optimization, 5(1), 51\u201392.","journal-title":"Advanced Modelling and Optimization"},{"key":"1474_CR2","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. (1994). Analysis on symmetric cones. New York: Oxford University Press."},{"issue":"1","key":"1474_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0377-0427(97)00153-2","volume":"86","author":"L. Faybusovich","year":"1997","unstructured":"Faybusovich, L. (1997). Linear systems in Jordan algebras and primal-dual interior-point algorithms. Journal of Computational and Applied Mathematics, 86(1), 149\u2013175.","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"1","key":"1474_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s002090100286","volume":"239","author":"L. Faybusovich","year":"2002","unstructured":"Faybusovich, L. (2002). A Jordan-algebraic approach to potential-reduction algorithms. Mathematische Zeitschrift, 239(1), 117\u2013129.","journal-title":"Mathematische Zeitschrift"},{"key":"1474_CR5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02206810","volume":"62","author":"R. M. Freund","year":"1996","unstructured":"Freund, R. M. (1996). An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution. Annals of Operations Research, 62, 29\u201357.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"1474_CR6","doi-asserted-by":"crossref","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. (2011). Full Nesterov-Todd step infeasible interior-point method for symmetric optimization. European Journal of Operational Research, 214(3), 473\u2013484.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"1474_CR7","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/moor.21.4.860","volume":"21","author":"O. G\u00fcler","year":"1996","unstructured":"G\u00fcler, O. (1996). Barrier functions in interior-point methods. Mathematics of Operations Research, 21(4), 860\u2013885.","journal-title":"Mathematics of Operations Research"},{"key":"1474_CR8","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1017\/S144618111200003X","volume":"53","author":"B. Kheirfam","year":"2011","unstructured":"Kheirfam, B. (2011). A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity. ANZIAM Journal, 53, 48\u201367.","journal-title":"ANZIAM Journal"},{"issue":"3","key":"1474_CR9","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1023\/A:1017920200889","volume":"112","author":"M. Muramatsu","year":"2002","unstructured":"Muramatsu, M. (2002). On a commutative class of search directions for linear programming over symmetric cones. Journal of Optimization Theory and Applications, 112(3), 595\u2013625.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"1474_CR10","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., & Nemirovski, A. (1994). Interior-point polynomial algorithms in convex programming. Philadelphia: SIAM."},{"issue":"1","key":"1474_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"Y. E. Nesterov","year":"1997","unstructured":"Nesterov, Y. E., & Todd, M. J. (1997). Self-scaled barriers and interior-point methods for convex programming. Mathematics of Operations Research, 22(1), 1\u201342.","journal-title":"Mathematics of Operations Research"},{"key":"1474_CR12","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02206812","volume":"62","author":"F. A. Potra","year":"1996","unstructured":"Potra, F. A. (1996). An O(nL) infeasible-interior-point algorithm for LCP with quadratic convergence. Annals of Operations Research, 62, 81\u2013102.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"1474_CR13","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1137\/040606557","volume":"16","author":"B. K. Rangarajan","year":"2006","unstructured":"Rangarajan, B. K. (2006). Polynomial convergence of infeasible-interior-point methods over symmetric cones. SIAM Journal on Optimization, 16(4), 1211\u20131229.","journal-title":"SIAM Journal on Optimization"},{"issue":"4","key":"1474_CR14","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1137\/050623917","volume":"16","author":"C. Roos","year":"2006","unstructured":"Roos, C. (2006). A full-Newton step O(n) infeasible interior-point algorithm for linear optimization. SIAM Journal on Optimization, 16(4), 1110\u20131136.","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"1474_CR15","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10107-003-0380-z","volume":"96","author":"S. H. Schmieta","year":"2003","unstructured":"Schmieta, S. H., & Alizadeh, F. (2003). Extension of primal-dual interior-point algorithms to symmetric cones. Mathematical Programming, 96(3), 409\u2013438.","journal-title":"Mathematical Programming"},{"issue":"1\u20133","key":"1474_CR16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0024-3795(00)00096-3","volume":"312","author":"J. F. Sturm","year":"2000","unstructured":"Sturm, J. F. (2000). Similarity and other spectral relations for symmetric cones. Algebra and Applications, 312(1\u20133), 135\u2013154.","journal-title":"Algebra and Applications"},{"key":"1474_CR17","unstructured":"Vieira, M. V. C. (2007). Jordan algebraic approach to symmetric optimization. Ph.D thesis, Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, The Netherlands."},{"issue":"3","key":"1474_CR18","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1007\/s10957-012-0013-x","volume":"154","author":"G. Q. Wang","year":"2012","unstructured":"Wang, G. Q., & Bai, Y. Q. (2012). A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization. Journal of Optimization Theory and Applications, 154(3), 966\u2013985.","journal-title":"Journal of Optimization Theory and Applications"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1474-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-013-1474-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1474-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T22:08:12Z","timestamp":1716070092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-013-1474-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,25]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["1474"],"URL":"https:\/\/doi.org\/10.1007\/s10479-013-1474-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,25]]}}}