{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:50:34Z","timestamp":1648853434946},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,10,11]],"date-time":"2011-10-11T00:00:00Z","timestamp":1318291200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s11075-011-9506-1","type":"journal-article","created":{"date-parts":[[2011,10,10]],"date-time":"2011-10-10T14:52:58Z","timestamp":1318258378000},"page":"589-606","source":"Crossref","is-referenced-by-count":10,"title":["Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step"],"prefix":"10.1007","volume":"59","author":[{"given":"Behrouz","family":"Kheirfam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,11]]},"reference":[{"key":"9506_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F Alizadeh","year":"1995","unstructured":"Alizadeh, F.: Interior-point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5, 13\u201351 (1995)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9506_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":"9506_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/b105286","volume-title":"Aspects of Semidefinite Programming. Applied Optimization, vol. 65","author":"E Klerk De","year":"2002","unstructured":"De Klerk, E.: Aspects of Semidefinite Programming. Applied Optimization, vol. 65. Kluwer Academic, Dordrecht (2002)"},{"issue":"3","key":"9506_CR4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/ijoc.12.3.177.12637","volume":"12","author":"ES Karisch","year":"2000","unstructured":"Karisch, E.S., Rendl, F., Clausen, J.: Solving graph bisection problems with semidefinite programming. INFORMS J. Comput. 12(3), 177\u2013191 (2000)","journal-title":"INFORMS J. Comput."},{"key":"9506_CR5","first-page":"129","volume":"80","author":"M Kojima","year":"1998","unstructured":"Kojima, M., Shida, M., Hara, S.: Local convergence of predictor-corrector infeasible interior-point algorithm for SDPs and SDLCPs. Math. Program. Ser. A, 80, 129\u2013160 (1998)","journal-title":"Math. Program. Ser. A"},{"key":"9506_CR6","series-title":"Lecture Notes in Comput. Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54509-3","volume-title":"A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems","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 Comput. Sci., vol. 538. Springer, Berlin (1991)"},{"key":"9506_CR7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s11075-007-9135-x","volume":"46","author":"Z Liu","year":"2007","unstructured":"Liu, Z., Sun, W.: An infeasible interior-point algorithm with full-Newton step for linear optimization. Numer. Algorithms 46, 173\u2013188 (2007)","journal-title":"Numer. Algorithms"},{"key":"9506_CR8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1137\/S1052623496299187","volume":"8","author":"ZQ Luo","year":"1998","unstructured":"Luo, Z.Q., Sturm, J., Zhang, S.Z.: Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming. SIAM J. Optim. 8, 59\u201381 (1998)","journal-title":"SIAM J. Optim."},{"key":"9506_CR9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"IJ Lustig","year":"1990\/1991","unstructured":"Lustig, I.J.: Feasible issues in a primal-dual interior point method for linear programming. Math. Program. 49, 145\u2013162 (1990\/1991)","journal-title":"Math. Program."},{"key":"9506_CR10","volume-title":"Handbook of Matrices","author":"H L\u00fctkepohl","year":"1996","unstructured":"L\u00fctkepohl, H.: Handbook of Matrices. Wiley, Chichester (1996)"},{"key":"9506_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. Algorithms 52, 225\u2013255 (2009)","journal-title":"Numer. Algorithms"},{"issue":"3","key":"9506_CR12","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1080\/10556780600816692","volume":"22","author":"H Mansouri","year":"2007","unstructured":"Mansouri, H., Roos, C.: Simplified O(nL) infeasible interior-point algorithm for linear optimization using full-Newton step. Optim. Methods Softw. 22(3), 519\u2013530 (2007)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"9506_CR13","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":"2","key":"9506_CR14","doi-asserted-by":"crossref","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":"9506_CR15","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1023\/A:1017514422146","volume":"109","author":"J Peng","year":"2001","unstructured":"Peng, J., Roos, C., Terlaky, T.: New complexity analysis of the primal-dual method for semidefinite optimization based on the NT-direction. J. Optim. Theory Appl. 109(2), 327\u2013343 (2001)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"9506_CR16","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. Ser. A. 93(1), 129\u2013171 (2002)","journal-title":"Math. Program. Ser. A."},{"key":"9506_CR17","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 (2002)"},{"key":"9506_CR18","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1137\/S1052623495294955","volume":"8","author":"FA Potra","year":"1998","unstructured":"Potra, F.A., Sheng, R.: A superlinear 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":"9506_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":"9506_CR20","volume-title":"Theory and Algorithm for Linear Optimization. An Interior-Point Approach","author":"C Roos","year":"1997","unstructured":"Roos, C., Terlaky, T., Vial, J.-Ph.: Theory and Algorithm for Linear Optimization. An Interior-Point Approach. Wiley, Chichester (1997)"},{"key":"9506_CR21","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10852-005-3561-3","volume":"4","author":"GQ Wang","year":"2005","unstructured":"Wang, G.Q., Bai, Y.Q., Roos, C.: Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function. J. Math. Model. Algorithms 4, 409\u2013433 (2005)","journal-title":"J. Math. Model. Algorithms"},{"key":"9506_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4381-7","volume-title":"Handbook of Semidefinite Programming, Theory, Algorithm, and Applications","author":"H Wolkowicz","year":"2000","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L.: Handbook of Semidefinite Programming, Theory, Algorithm, and Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands (2000)"},{"issue":"3","key":"9506_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 interior-point algorithm for second-order cone optimization with full Nesterov-Todd steps. Appl. Math. Comput. 215(3), 1047\u20131061 (2009)","journal-title":"Appl. Math. Comput."},{"key":"9506_CR24","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1137\/S1052623495296115","volume":"8","author":"Y Zhang","year":"1998","unstructured":"Zhang, Y.: On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8, 365\u2013386 (1998)","journal-title":"SIAM J. Optim."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-011-9506-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-011-9506-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-011-9506-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:08:17Z","timestamp":1559365697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-011-9506-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,11]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9506"],"URL":"https:\/\/doi.org\/10.1007\/s11075-011-9506-1","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,11]]}}}