{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:58:11Z","timestamp":1762505891769},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,3,15]],"date-time":"2012-03-15T00:00:00Z","timestamp":1331769600000},"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,12]]},"DOI":"10.1007\/s11075-012-9557-y","type":"journal-article","created":{"date-parts":[[2012,3,14]],"date-time":"2012-03-14T09:43:52Z","timestamp":1331718232000},"page":"659-680","source":"Crossref","is-referenced-by-count":24,"title":["Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term"],"prefix":"10.1007","volume":"61","author":[{"given":"Behrouz","family":"Kheirfam","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,15]]},"reference":[{"issue":"1","key":"9557_CR1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1137\/S1052623403423114","volume":"15","author":"YQ Bai","year":"2004","unstructured":"Bai, Y.Q., El Ghami, M., Roos, C.: A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM J. Optim. 15(1), 101\u2013128 (2004)","journal-title":"SIAM J. Optim."},{"issue":"12","key":"9557_CR2","doi-asserted-by":"crossref","first-page":"2169","DOI":"10.1007\/s10114-009-6457-8","volume":"25","author":"YQ Bai","year":"2009","unstructured":"Bai, Y.Q., Guo, J., Roos, C.: A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms. Acta Math. Sin., Engl. Ser. 25(12), 2169\u20132178 (2009)","journal-title":"Acta Math. Sin., Engl. Ser."},{"issue":"6","key":"9557_CR3","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1080\/10556780310001639735","volume":"18","author":"YQ Bai","year":"2003","unstructured":"Bai, Y.Q., Roos, C.: A polynomial-time algorithm for linear optimization based a new simple kernel function. Optim. Methods Softw. 18(6), 631\u2013646 (2003)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"9557_CR4","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10957-008-9389-z","volume":"138","author":"YQ Bai","year":"2008","unstructured":"Bai, Y.Q., Lesaja, G., Roos, C., Wang, G.Q., El Ghami, M.: A class of large-update and small-update primal-dual interior-point algorithms for linear optimization. J. Optim. Theory Appl. 138(3), 341\u2013359 (2008)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"9557_CR5","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1137\/S1052623401398132","volume":"13","author":"YQ Bai","year":"2003","unstructured":"Bai, Y.Q., El Ghami, M., Roos, C.: A new efficient large-update primal-dual interior-point method based on a finite barrier. SIAM J. Optim. 13(3), 766\u2013782 (2003)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9557_CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1051\/ro\/2009011","volume":"43","author":"YQ Bai","year":"2009","unstructured":"Bai, Y.Q., El Ghami, M., Roos, C.: Kernel function based algorithms for semidefinite optimization. Int. J. RAIRO-Oper. Res. 43(2), 189\u2013199 (2009)","journal-title":"Int. J. RAIRO-Oper. Res."},{"key":"9557_CR7","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)"},{"key":"9557_CR8","author":"M Ghami El","year":"2011","unstructured":"El Ghami, M., Guennoun, Z.A., Bouali, S., Steihaug, T.: Interior-point methods for linear optimization based on a kernel function with trigonmetric barrier term. J. Comput. Appl. Math. (2011). doi: 10.1016\/j.cam.2011.05.036","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"9557_CR9","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1080\/10556780903239048","volume":"25","author":"M Ghami El","year":"2010","unstructured":"El Ghami, M., Steihaug, T., Roos, C.: A generic primal-dual IPMS for semidefinite based on kernel functions. Optim. Methods Softw. 25(3), 387\u2013403 (2010)","journal-title":"Optim. Methods Softw."},{"key":"9557_CR10","unstructured":"Helmberg, C.: Simedefinite programming for combinatorial optimization. Technical Report 00-34, Konrad-Zuse-Zentrum f\u00fcr Informationstechink Berlin, Takustrabe 7, D-14195 Berlin (2000)"},{"key":"9557_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511840371","volume-title":"Topics in Matrix Analysis","author":"RA Horn","year":"1991","unstructured":"Horn, R.A., Johnson, C.R.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1991)"},{"key":"9557_CR12","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"},{"key":"9557_CR13","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/S1052623494269035","volume":"7","author":"M Kojima","year":"1997","unstructured":"Kojima, M., Shida, M., Hara, S.: Interior point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optim. 7, 86\u2013125 (1997)","journal-title":"SIAM J. Optim."},{"key":"9557_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-99970-3","volume-title":"Analytic Inequalities","author":"DS Mitrinovi\u0107","year":"1970","unstructured":"Mitrinovi\u0107, D.S.: Analytic Inequalities. Springer, New York (1970)"},{"issue":"1","key":"9557_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."},{"key":"9557_CR16","volume-title":"SIAM Stud. Appl. Math., vol. 13","author":"YE Nesterov","year":"1994","unstructured":"Nesterov, Y.E., Nemirovskii, A.S.: Interior point polynomial algorithms in convex programming. In: SIAM Stud. Appl. Math., vol. 13. SIAM, Philadelphia (1994)"},{"issue":"1","key":"9557_CR17","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. 93(1), 129\u2013171 (2002)","journal-title":"Math. Program."},{"key":"9557_CR18","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":"9557_CR19","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/S0377-2217(02)00275-8","volume":"143","author":"J Peng","year":"2002","unstructured":"Peng, J., Roos, C., Terlaky, T.: A new class of polynomial primal-dual methods for linear and semidefinite optimization. Eur. J. Oper. Res. 143, 234\u2013256 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"9557_CR20","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/s11741-008-0503-2","volume":"12","author":"ZG Qian","year":"2008","unstructured":"Qian, Z.G., Bai, Y.Q., Wang, G.Q.: Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization. J. Shanghai Univ. (Engl Ed). 12(5), 388\u2013394 (2008)","journal-title":"J. Shanghai Univ. (Engl Ed)."},{"key":"9557_CR21","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, Chichester (1997)"},{"key":"9557_CR22","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."},{"key":"9557_CR23","doi-asserted-by":"crossref","first-page":"3389","DOI":"10.1016\/j.na.2009.01.241","volume":"71","author":"GQ Wang","year":"2009","unstructured":"Wang, G.Q., Bai, Y.Q.: Primal-dual interior-point algorithm for convex quadratic semi-definite optimization. Nonlinear Anal. 71, 3389\u20133402 (2009)","journal-title":"Nonlinear Anal."},{"issue":"4","key":"9557_CR24","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(4), 409\u2013433 (2005)","journal-title":"J. Math. Model. Algorithms"},{"key":"9557_CR25","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, Dordrecht (2000)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9557-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-012-9557-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9557-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:08:18Z","timestamp":1559365698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-012-9557-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,15]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["9557"],"URL":"https:\/\/doi.org\/10.1007\/s11075-012-9557-y","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,15]]}}}