{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T04:33:41Z","timestamp":1712896421669},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,4,2]],"date-time":"2018-04-02T00:00:00Z","timestamp":1522627200000},"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":[[2019,2]]},"DOI":"10.1007\/s11590-018-1257-7","type":"journal-article","created":{"date-parts":[[2018,4,2]],"date-time":"2018-04-02T09:46:33Z","timestamp":1522662393000},"page":"127-145","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function"],"prefix":"10.1007","volume":"13","author":[{"given":"M.","family":"Moslemi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Kheirfam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,2]]},"reference":[{"key":"1257_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1137\/S1052623403423114","volume":"1","author":"Y Bai","year":"2004","unstructured":"Bai, Y., El Ghami, M., Roos, C.: A comparative study of kernel functions for primal\u2013dual interior-point algorithms in linear optimization. SIAM J. Optim. 1, 101\u2013128 (2004)","journal-title":"SIAM J. Optim."},{"key":"1257_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0653-8","volume-title":"Matrix Analysis","author":"R Bhatia","year":"1997","unstructured":"Bhatia, R.: Matrix Analysis. Springer, Berlin (1997)"},{"key":"1257_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/b105286","volume-title":"Aspects of Semidefinite Programming: Interior Point Methods and Selected Applications","author":"E Klerk De","year":"2002","unstructured":"De Klerk, E.: Aspects of Semidefinite Programming: Interior Point Methods and Selected Applications. Kluwer Academic Publisher, Dordrecht (2002)"},{"issue":"3","key":"1257_CR4","first-page":"541","volume":"40","author":"B Kheirfam","year":"2014","unstructured":"Kheirfam, B., Mahdavi-Amiri, N.: A full Nesterov\u2013Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem. Bull. Iran. Math. Soc. 40(3), 541\u2013564 (2014)","journal-title":"Bull. Iran. Math. Soc."},{"issue":"4","key":"1257_CR5","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/s11075-012-9557-y","volume":"61","author":"B Kheirfam","year":"2012","unstructured":"Kheirfam, B.: Primal\u2013dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term. Numer. Algorithms 61(4), 659\u2013680 (2012)","journal-title":"Numer. Algorithms"},{"issue":"4","key":"1257_CR6","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10852-013-9240-x","volume":"13","author":"B Kheirfam","year":"2014","unstructured":"Kheirfam, B.: A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function. J. Math. Model. Algorithms Oper. Res. 13(4), 471\u2013491 (2014)","journal-title":"J. Math. Model. Algorithms Oper. Res."},{"issue":"1","key":"1257_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. Algor. Oper. Res. 7(1), 103\u2013110 (2013)","journal-title":"Algor. Oper. Res."},{"issue":"4","key":"1257_CR8","doi-asserted-by":"publisher","first-page":"601","DOI":"10.3934\/naco.2013.3.601","volume":"3","author":"B Kheirfam","year":"2013","unstructured":"Kheirfam, B.: A full Nesterov\u2013Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function. Numer. Algebra Control Optim. 3(4), 601\u2013614 (2013)","journal-title":"Numer. Algebra Control Optim."},{"issue":"4","key":"1257_CR9","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1080\/02331934.2015.1080255","volume":"65","author":"B Kheirfam","year":"2015","unstructured":"Kheirfam, B., Haghighi, M.: A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function. Optimization 65(4), 841\u2013857 (2015)","journal-title":"Optimization"},{"issue":"2","key":"1257_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.2298\/YJOR120904006K","volume":"25","author":"B Kheirfam","year":"2015","unstructured":"Kheirfam, B., Moslemi, M.: A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term. Yugosl. J. Oper. Res. 25(2), 233\u2013250 (2015)","journal-title":"Yugosl. J. Oper. Res."},{"issue":"2","key":"1257_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01581723","volume":"80","author":"M Kojima","year":"1998","unstructured":"Kojima, M., Shida, M., Shindoh, S.: Local convergence of predictor\u2013corrector infeasible-interior-point method for SDPs and SDLCPs. Math. Program. 80(2), 129\u2013160 (1998)","journal-title":"Math. Program."},{"key":"1257_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00245-009-9069-x","volume":"60","author":"Z Liu","year":"2009","unstructured":"Liu, Z., Sun, W., Tian, F.: A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function. Appl. Math. Optim. 60, 237\u2013251 (2009)","journal-title":"Appl. Math. Optim."},{"issue":"3","key":"1257_CR13","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1080\/10556780600816692","volume":"22","author":"H Mansouri","year":"2007","unstructured":"Mansouri, H., Roos, C.: Simplified \n                    \n                      \n                    \n                    $$O(nL)$$\n                    \n                      \n                        \n                          O\n                          (\n                          n\n                          L\n                          )\n                        \n                      \n                    \n                   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":"2","key":"1257_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s11075-009-9270-7","volume":"52","author":"H Mansouri","year":"2007","unstructured":"Mansouri, H., Roos, C.: A new full-Newton step \n                    \n                      \n                    \n                    $$O(n)$$\n                    \n                      \n                        \n                          O\n                          (\n                          n\n                          )\n                        \n                      \n                    \n                   infeasible interior point algorithm for semidefinite optimization. Numer. Algorithms 52(2), 225\u2013255 (2007)","journal-title":"Numer. Algorithms"},{"issue":"2","key":"1257_CR15","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\u2013dual interior point methods for self-scaled cones. SIAM J. Optim. 8(2), 324\u2013364 (1998)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1257_CR16","doi-asserted-by":"publisher","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. 93(1), 129\u2013171 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"1257_CR17","doi-asserted-by":"publisher","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\u2013dual 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\u20133","key":"1257_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1080\/10556789808805691","volume":"9","author":"FA Potra","year":"1998","unstructured":"Potra, F.A., Sheng, R.: On homogeneous interior-point algorithms for semidefinite programming. Optim. Methods Softw. 9(1\u20133), 161\u2013184 (1998)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"1257_CR19","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1137\/S1052623495294955","volume":"8","author":"FA Potra","year":"1998","unstructured":"Potra, F.A., Sheng, R.: A superlinearly convergent primal\u2013dual infeasible-interior-point algorithm for semidefinite programming. SIAM J. Optim. 8(4), 1007\u20131028 (1998)","journal-title":"SIAM J. Optim."},{"key":"1257_CR20","volume-title":"Theory and Algorithms for Linear Optimization: An Interior-Point Approach","author":"C Roos","year":"2006","unstructured":"Roos, C., Terlaky, T., Vial, J.-P.: Theory and Algorithms for Linear Optimization: An Interior-Point Approach, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"issue":"4","key":"1257_CR21","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 \n                    \n                      \n                    \n                    $$O(n)$$\n                    \n                      \n                        \n                          O\n                          (\n                          n\n                          )\n                        \n                      \n                    \n                   infeasible interior-point algorithm for linear optimization. SIAM J. Optim. 16(4), 1110\u20131136 (2006)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1257_CR22","first-page":"966","volume":"154","author":"GQ Wang","year":"2012","unstructured":"Wang, G.Q., Bai, Y.Q.: A new full Nesterov\u2013Todd step primal\u2013dual path-following interior-point algorithm for symmetric optimization. J. Math. Anal. Appl. 154(3), 966\u2013985 (2012)","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"1257_CR23","doi-asserted-by":"publisher","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\u2013dual path-following interio-point algorithm for semidefinite optimization. J. Math. Anal. Appl. 353(1), 339\u2013349 (2009)","journal-title":"J. Math. Anal. Appl."},{"issue":"4","key":"1257_CR24","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s11075-010-9444-3","volume":"57","author":"GQ Wang","year":"2011","unstructured":"Wang, G.Q., Zhu, D.T.: A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO. Numer. Algorithms 57(4), 537\u2013558 (2011)","journal-title":"Numer. Algorithms"},{"key":"1257_CR25","doi-asserted-by":"publisher","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., Vadenberghe, L.: Handbook of Semidefinite Programming, Theory, Algorithm, and Applications. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"1257_CR26","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1137\/S1052623495296115","volume":"8","author":"Y Zhang","year":"1998","unstructured":"Zhang, Y.: On extending some primal\u2013dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8, 365\u2013386 (1998)","journal-title":"SIAM J. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1257-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1257-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1257-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T23:31:22Z","timestamp":1554161482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1257-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,2]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["1257"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1257-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,2]]},"assertion":[{"value":"30 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}