{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T09:57:19Z","timestamp":1712570239314},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,5,16]],"date-time":"2014-05-16T00:00:00Z","timestamp":1400198400000},"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":["J Math Model Algor"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s10852-014-9257-9","type":"journal-article","created":{"date-parts":[[2014,5,15]],"date-time":"2014-05-15T01:46:24Z","timestamp":1400118384000},"page":"55-66","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Adaptive Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semidefinite Optimization"],"prefix":"10.1007","volume":"14","author":[{"given":"Behrouz","family":"Kheirfam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,16]]},"reference":[{"key":"9257_CR1","doi-asserted-by":"crossref","first-page":"6437","DOI":"10.1016\/j.amc.2010.12.083","volume":"217","author":"D Benterki","year":"2011","unstructured":"Benterki, D., Keraghel, A.: Finding a strict feasible solution of a linear semidefinite program. Appl. Math. Comput. 217, 6437\u20136440 (2011)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"9257_CR2","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."},{"key":"9257_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/b105286","volume-title":"Aspects of Semidefinite Programming, Vol. 65","author":"E Klerk De","year":"2002","unstructured":"De Klerk, E.: Aspects of Semidefinite Programming, Vol. 65. Kluwer Academic, Dordrecht (2002)"},{"key":"9257_CR4","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":"4","key":"9257_CR5","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/s11075-011-9506-1","volume":"59","author":"B Kheirfam","year":"2012","unstructured":"Kheirfam, B.: Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step. Numer. Algorithm. 59(4), 589\u2013606 (2012)","journal-title":"Numer. Algorithm."},{"key":"9257_CR6","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1017\/S144618111200003X","volume":"53","author":"B Kheirfam","year":"2011","unstructured":"Kheirfam, B.: A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity. ANZIAM J. 53, 48\u201367 (2011)","journal-title":"ANZIAM J."},{"key":"9257_CR7","first-page":"103","volume":"7","author":"B Kheirfam","year":"2013","unstructured":"Kheirfam, B.: A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function. Algorithmic Oper. Res. 7, 103\u2013110 (2013)","journal-title":"Algorithmic Oper. Res."},{"key":"9257_CR8","doi-asserted-by":"crossref","unstructured":"Kheirfam, B., Mahdavi-Amiri, N.: A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem, Bulletin of the Iranian Mathematical Society, (2013)","DOI":"10.3934\/naco.2013.3.601"},{"issue":"3","key":"9257_CR9","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. 61(3), 263\u2013280 (1993)","journal-title":"Math. Program."},{"key":"9257_CR10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01588785","volume":"67","author":"IJ Lustig","year":"1990","unstructured":"Lustig, I.J.: Feasible issues in a primal-dual interior-point method. Math. Program. 67, 145\u2013162 (1990)","journal-title":"Math. Program."},{"key":"9257_CR11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s11075-009-9270-7","volume":"52","author":"H Mansouri","year":"2009","unstructured":"Mansouri, H., Roos, C.: A new full-Newton step O(n) infeasible interior-point algorithm for semidefinite optimization. Numer. Algorithm. 52, 225\u2013255 (2009)","journal-title":"Numer. Algorithm."},{"issue":"2","key":"9257_CR12","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1080\/02331934.2011.611881","volume":"62","author":"H Mansouri","year":"2013","unstructured":"Mansouri, H., Zangiabadi, M.: An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization. Optim. 62(2), 285\u2013297 (2013)","journal-title":"Optim."},{"key":"9257_CR13","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. 67, 109\u2013119 (1994)","journal-title":"Math. Program."},{"key":"9257_CR14","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S Mizuno","year":"1993","unstructured":"Mizuno, S., Todd, M.J., Ye, Y.: On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18, 964\u2013981 (1993)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9257_CR15","doi-asserted-by":"crossref","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":"1","key":"9257_CR16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/0806002","volume":"6","author":"AF Potra","year":"1996","unstructured":"Potra, A.F.: An infeasible-interior-point predictor-corrector algorithm for linear programming. SIAM J. Optim. 6(1), 19\u201332 (1996)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9257_CR17","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF01582228","volume":"67","author":"AF Potra","year":"1994","unstructured":"Potra, A.F.: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points. Math. Program. 67(3), 383\u2013406 (1994)","journal-title":"Math. Program."},{"key":"9257_CR18","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1137\/S1052623495294955","volume":"8","author":"AF Potra","year":"1998","unstructured":"Potra, A.F., Sheng, R.: A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming. SIAM J. Optim. 8, 1007\u20131028 (1998)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9257_CR19","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":"9257_CR20","volume-title":"Theory and Algorithms for Linear Optimization. An Interior-Point Approach","author":"C Roos","year":"1997","unstructured":"Roos, C., Terlaky, T., Vial, J.-Ph.: Theory and Algorithms for Linear Optimization. An Interior-Point Approach. Wiley, UK (1997)"},{"key":"9257_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10556789908805745","volume":"11","author":"MJ Todd","year":"1999","unstructured":"Todd, M.J.: A study of search directions in primal-dual interior-point methods for semidefinite programming. Optim. Methods & Softw. 11, 1\u201346 (1999)","journal-title":"Optim. Methods & Softw."},{"issue":"15","key":"9257_CR22","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.amc.2013.06.064","volume":"221","author":"GQ Wang","year":"2013","unstructured":"Wang, G.Q., Yu, C.J., Teo, K.L.: A full Nesterov-Todd step feasible interior-point method for convex quadratic optimization over symmetric cone. Appl. Math. Comput. 221(15), 329\u2013343 (2013)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"9257_CR23","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-Todd step. Appl. Math. Comput. 215(3), 1047\u20131061 (2009)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"9257_CR24","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(1), 339\u2013349 (2009)","journal-title":"J. Math. Anal. Appl."},{"issue":"3","key":"9257_CR25","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."},{"issue":"3","key":"9257_CR26","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1007\/s10957-013-0278-8","volume":"158","author":"M Zangiabadi","year":"2013","unstructured":"Zangiabadi, M., Gu, G., Roos, C.: A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization. J. Optim. Theory Appl. 158(3), 816\u2013858 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"9257_CR27","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 horizantal linear complementary problem. SIAM J. Optim. 4, 208\u2013227 (1994)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9257_CR28","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1080\/02331934.2011.571257","volume":"62","author":"L Zhang","year":"2013","unstructured":"Zhang, L., Sun, L., Xu, Y.: Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming. Optim. 62(2), 169\u2013191 (2013)","journal-title":"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-014-9257-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-014-9257-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-014-9257-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T09:28:13Z","timestamp":1565429293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-014-9257-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,16]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["9257"],"URL":"https:\/\/doi.org\/10.1007\/s10852-014-9257-9","relation":{},"ISSN":["2214-2487","2214-2495"],"issn-type":[{"value":"2214-2487","type":"print"},{"value":"2214-2495","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,16]]}}}