{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T11:47:47Z","timestamp":1776685667559,"version":"3.51.2"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,1,19]],"date-time":"2016-01-19T00:00:00Z","timestamp":1453161600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s11590-016-0997-5","type":"journal-article","created":{"date-parts":[[2016,1,19]],"date-time":"2016-01-19T12:06:11Z","timestamp":1453205171000},"page":"135-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path"],"prefix":"10.1007","volume":"11","author":[{"given":"Ximei","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinkui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,19]]},"reference":[{"key":"997_CR1","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1080\/10556789908805769","volume":"11","author":"B Borchers","year":"1999","unstructured":"Borchers, B.: Sdplib 1.2, a library of semidefinite programming test problems. Optim. Methods Softw. 11, 683\u2013690 (1999)","journal-title":"Optim. Methods Softw."},{"key":"997_CR2","doi-asserted-by":"crossref","unstructured":"Browne, S., Dongarra, J., Grosse, E., Rowan, T.: The Netlib Mathematical Software Repository. Corporation for National Research Initiatives, Reston (1995)","DOI":"10.1045\/september95-browne"},{"key":"997_CR3","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534778.001.0001","volume-title":"Analysis on Symmetric Cone","author":"J Faraut","year":"1994","unstructured":"Faraut, J., Kor\u00e1nyi, A.: Analysis on Symmetric Cone. Oxford University Press, New York (1994)"},{"key":"997_CR4","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.: Linear systems in Jordan algebras and primal-dual interior-point algorithms. J. Comput. Appl. Math. 86, 149\u2013175 (1997)","journal-title":"J. Comput. Appl. Math."},{"key":"997_CR5","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.: Barrier functions in interior-point methods. Math. Oper. Res. 21, 860\u2013885 (1996)","journal-title":"Math. Oper. Res."},{"key":"997_CR6","first-page":"17","volume":"76","author":"B Jansen","year":"1996","unstructured":"Jansen, B., Roos, C., Terlaky, T., Ye, Y.: Improved complexity using higher-order correctors for primal-dual dikin affine scaling. Math. Program. 76, 17\u2013130 (1996)","journal-title":"Math. Program."},{"key":"997_CR7","doi-asserted-by":"crossref","unstructured":"Lahmam, H., Cadou, J.M., Zahrouni, H., Damil, N., Potier-Ferry, M.: High-order predictor-corrector algorithms. Int. J. Numer. Methods Eng. 55, 685\u2013704 (2002). http:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/nme.524\/abstract","DOI":"10.1002\/nme.524"},{"key":"997_CR8","unstructured":"Liu, C.: Study on complexity of some interior-point algorithms in conic programming (in Chinese). Ph.D. thesis, Xidian University (2012)"},{"key":"997_CR9","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1007\/s10957-012-0018-5","volume":"154","author":"C Liu","year":"2012","unstructured":"Liu, C., Liu, H., Liu, X.: Polynomial convergence of second-order mehrotra-type predictor\u2013corrector algorithms over symmetric cones. J. Optim. Theory Appl. 154, 949\u2013965 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"997_CR10","first-page":"949","volume":"158","author":"H Liu","year":"2013","unstructured":"Liu, H., Yang, X., Liu, C.: A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming. J. Optim. Theory Appl. 158, 949\u2013965 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"997_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"Y Nesterov","year":"1997","unstructured":"Nesterov, Y., Todd, M.: Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22, 1\u201342 (1997)","journal-title":"Math. Oper. Res."},{"key":"997_CR12","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1137\/S1052623495290209","volume":"8","author":"Y Nesterov","year":"1998","unstructured":"Nesterov, Y., Todd, M.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8, 324\u2013364 (1998)","journal-title":"SIAM J. Optim."},{"key":"997_CR13","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1137\/040606557","volume":"16","author":"BK Rangarajan","year":"2006","unstructured":"Rangarajan, B.K.: Polynomial convergence of infeasible-interior-point methods over symmetric cones. SIAM J. Optim. 16, 1211\u20131229 (2006)","journal-title":"SIAM J. Optim."},{"key":"997_CR14","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1016\/j.amc.2006.05.092","volume":"183","author":"M Salahi","year":"2006","unstructured":"Salahi, M., Mahdavi-Amiri, N.: Polynomial time second order Mehrotra-type predictor-corrector algorithms. Appl. Math. Comput. 183, 646\u2013658 (2006)","journal-title":"Appl. Math. Comput."},{"key":"997_CR15","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10107-003-0380-z","volume":"96","author":"SH Schmieta","year":"2003","unstructured":"Schmieta, S.H., Alizadeh, F.: Extension of primal-dual interior point algorithm to symmetric cones. Math. Program. 96, 409\u2013438 (2003)","journal-title":"Math. Program."},{"key":"997_CR16","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM Publications, Philsdephia (1997)"},{"key":"997_CR17","unstructured":"Yang, Y.: Arc-search path-following interior-point algorithms for linear programming. Optimization Oline (2009). http:\/\/www.optimization-online.org\/ARCHIVE_CAT\/LINSDP\/2009.html"},{"key":"997_CR18","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.ejor.2011.06.020","volume":"215","author":"Y Yang","year":"2011","unstructured":"Yang, Y.: A polynomial arc-search interior-point algorithm for convex quadratic programming. Eur. J. Oper. Res. 215, 25\u201338 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"997_CR19","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1007\/s10957-013-0281-0","volume":"158","author":"Y Yang","year":"2013","unstructured":"Yang, Y.: A polynomial arc-search interior-point algorithm for linear programming. J. Optim. Theory Appl. 158, 859\u2013873 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"997_CR20","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01585769","volume":"68","author":"Y Zhang","year":"1995","unstructured":"Zhang, Y., Zhang, D.: On polynomiality of the mehrotra-type predictor\u2013corrector interior-point algorithms. Math. Program. 68, 303\u2013318 (1995)","journal-title":"Math. Program."},{"key":"997_CR21","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s00186-010-0334-1","volume":"73","author":"J Zhang","year":"2011","unstructured":"Zhang, J., Zhang, K.: Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming. Math. Meth. Oper. Res. 73, 75\u201390 (2011)","journal-title":"Math. Meth. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-0997-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-0997-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-0997-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-0997-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T21:36:47Z","timestamp":1718314607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-0997-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,19]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["997"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-0997-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,19]]}}}