{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:21Z","timestamp":1740123681925,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,10,29]],"date-time":"2020-10-29T00:00:00Z","timestamp":1603929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,29]],"date-time":"2020-10-29T00:00:00Z","timestamp":1603929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s11075-020-01033-1","type":"journal-article","created":{"date-parts":[[2020,10,29]],"date-time":"2020-10-29T22:02:17Z","timestamp":1604008937000},"page":"143-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7928-2618","authenticated-orcid":false,"given":"Behrouz","family":"Kheirfam","sequence":"first","affiliation":[]},{"given":"Naser","family":"Osmanpour","sequence":"additional","affiliation":[]},{"given":"Mohammad","family":"Keyanpour","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,29]]},"reference":[{"issue":"2","key":"1033_CR1","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/040604492","volume":"16","author":"W Ai","year":"2005","unstructured":"Ai, W., Zhang, S.: An $o(\\sqrt {n}L)$ iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP. SAIM J. Optim. 16(2), 400\u2013417 (2005)","journal-title":"SAIM J. Optim."},{"key":"1033_CR2","unstructured":"Alizadeh, F.: Combinatorial optimizationwith interior-point methods and semi-definite matrices. Ph.D.thesis, Computer Science Department, University of Minnesota Minneapolis (1991)"},{"issue":"1","key":"1033_CR3","doi-asserted-by":"publisher","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(1), 13\u201351 (1995)","journal-title":"SIAM J. Optim."},{"key":"1033_CR4","doi-asserted-by":"publisher","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":"1033_CR5","doi-asserted-by":"crossref","unstructured":"Boyd, S. E., Ghaoui, L.El., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory. SIAM studies in Applied Mathematics, SIAM, Philadelphia (1994)","DOI":"10.1137\/1.9781611970777"},{"key":"1033_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/b105286","volume-title":"Aspects of Semidefinite Programming","author":"E de Klerk","year":"2002","unstructured":"de Klerk, E.: Aspects of Semidefinite Programming. Kluwer Academic, Dordrecht (2002)"},{"issue":"2","key":"1033_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E. D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"4","key":"1033_CR8","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1137\/S1052623401390793","volume":"12","author":"M Halicka","year":"2002","unstructured":"Halicka, M., de Klerk, E., Roos, C.: On the convergence of the central path in semidefinite optimization. SIAM J. Optim. 12(4), 1090\u20131099 (2002)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1033_CR9","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C Helmberg","year":"1996","unstructured":"Helmberg, C., Rendl, F., Vanderbei, R., Wolkowicz, H.: An interiorpoint method for semidefinite programming. SIAM J. Optim. 6(2), 342\u2013361 (1996)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1033_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02614380","volume":"76","author":"B Jansen","year":"1997","unstructured":"Jansen, B., Roos, C., Terlaky, T.: Improved complexity using higher-order correctors for primal-dual Dikin affine scaling. Math. Program. 76(1), 117\u2013130 (1997)","journal-title":"Math. Program."},{"issue":"3","key":"1033_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.3233\/FI-2016-1385","volume":"146","author":"B Kheirfam","year":"2016","unstructured":"Kheirfam, B.: An arc-search interior point method in the $N^{-}_{\\infty }$ neighborhood for symmetric optimization. Fundam. Inform. 146(3), 255\u2013269 (2016)","journal-title":"Fundam. Inform."},{"issue":"12","key":"1033_CR12","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1080\/00207160.2017.1283020","volume":"94","author":"B Kheirfam","year":"2017","unstructured":"Kheirfam, B.: An arc-search infeasible interior point algorithm for HLCP in the $\\mathcal {N}^{-}_{\\infty }$ neighborhood of the central path. Int. J. Comput. Math. 94(12), 2271\u20132282 (2017)","journal-title":"Int. J. Comput. Math."},{"issue":"2","key":"1033_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.3934\/naco.2018015","volume":"8","author":"B Kheirfam","year":"2018","unstructured":"Kheirfam, B., Moslemi, M.: On the extend of an arc-search interior-point algorithm for semidefinite optimization. Numer. Algebra Control Optim. 8(2), 261\u2013275 (2018)","journal-title":"Numer. Algebra Control Optim."},{"issue":"1","key":"1033_CR14","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1137\/S1052623494269035","volume":"7","author":"M Kojima","year":"1997","unstructured":"Kojima, M., Shindoh, S., Hara, S.: Interior-pointmethods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optim. 7(1), 86\u2013125 (1997)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1033_CR15","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J. B.: Globle optimization with polynomials and the problems of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1033_CR16","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1033_CR17","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1137\/S1052623495293056","volume":"7","author":"RDC Monteiro","year":"1997","unstructured":"Monteiro, R. D. C.: Primal-dual path-following algorithms for semidefenite programming. SIAM J. Optim. 7(3), 663\u2013678 (1997)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1033_CR18","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1137\/S1052623496308618","volume":"8","author":"RDC Monteiro","year":"1998","unstructured":"Monteiro, R. D. C.: Polynomial convergence of primal-dual algorithms for semidefnite programming based on Monteiro and Zhang family of directions. SIAM J. Optim. 8(3), 797\u2013812 (1998)","journal-title":"SIAM J. Optim."},{"issue":"12","key":"1033_CR19","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10107-003-0451-1","volume":"97","author":"RDC Monteiro","year":"2003","unstructured":"Monteiro, R. D. C.: First- and second-order methods for semidefnite programming. Math. Program. 97(12), 209\u2013244 (2003)","journal-title":"Math. Program."},{"issue":"3","key":"1033_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01580085","volume":"81","author":"RDC Monteiro","year":"1998","unstructured":"Monteiro, R. D. C., Zhang, Y.: A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming. Math. Program. 81(3), 281\u2013299 (1998)","journal-title":"Math. Program."},{"key":"1033_CR21","unstructured":"Nesterov, Y. E., Nemirovsk, A. S.: Interior point methods in convex programming: theory and applications. SIAM, Philadelphia (1994)"},{"issue":"1","key":"1033_CR22","doi-asserted-by":"publisher","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":"1033_CR23","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-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8(2), 324\u2013364 (1998)","journal-title":"SIAM J. Optim."},{"key":"1033_CR24","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K. C., Todd, M. J., Tutuncu, R. H.: SDPT3\u2013A Matlab software package for semidefinite programming. Optim. Methods Softw. 11, 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"10","key":"1033_CR25","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.1080\/00207160.2018.1545088","volume":"96","author":"W Wang","year":"2018","unstructured":"Wang, W., Liu, H., Bi, H.: A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization. Int. J. Comput. Math. 96(10), 1979\u20131992 (2018)","journal-title":"Int. J. Comput. Math."},{"issue":"2","key":"1033_CR26","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"PA Parrilo","year":"2003","unstructured":"Parrilo, P. A.: Semidefinite optimization relaxations for semialgebraic problems. Math. Program. 96(2), 293\u2013320 (2003)","journal-title":"Math. Program."},{"key":"1033_CR27","doi-asserted-by":"crossref","unstructured":"Yamashita, M., Fujisawa, K., Fukuda, M., Kobayashi, K., Nakata, K., Nakata, M.: Latest developments in the SDPA family for solving large-scale SDPs. In: Handbook on semidefinite, conic and polynomial optimization, pp. 687\u2013713 (2012)","DOI":"10.1007\/978-1-4614-0769-0_24"},{"issue":"1","key":"1033_CR28","doi-asserted-by":"publisher","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(1), 25\u201338 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1033_CR29","doi-asserted-by":"publisher","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(3), 859\u2013873 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1033_CR30","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1007\/s11075-018-0469-3","volume":"79","author":"Y Yang","year":"2018","unstructured":"Yang, Y.: Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming. Numer. Algorithm. 79(3), 957\u2013992 (2018)","journal-title":"Numer. Algorithm."},{"key":"1033_CR31","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s12190-015-0900-z","volume":"51","author":"X Yang","year":"2016","unstructured":"Yang, X., Zhang, Y., Liu, H.: A wide neighborhood infeasible-interior-point method with arc-search for linear programming. J. Appl. Math. Comput. 51, 209\u2013225 (2016)","journal-title":"J. Appl. Math. Comput."},{"key":"1033_CR32","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s11590-016-0997-5","volume":"11","author":"X Yang","year":"2017","unstructured":"Yang, X., Liu, H., Zhang, Y.: An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path. Optim. Lett. 11, 135\u2013152 (2017)","journal-title":"Optim. Lett."},{"key":"1033_CR33","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-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8, 365\u2013386 (1998)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"1033_CR34","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1007\/s11590-019-01414-z","volume":"13","author":"M Zhang","year":"2019","unstructured":"Zhang, M., Yuan, B., Zhou, Y., Luo, X., Huang, Z.h.: A primal-dual interior-point algorithm with arc-search for semidefinite programming. Optim. Lett. 13(5), 1157\u20131175 (2019)","journal-title":"Optim. Lett."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-01033-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-020-01033-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-01033-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T06:10:50Z","timestamp":1628489450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-020-01033-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,29]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["1033"],"URL":"https:\/\/doi.org\/10.1007\/s11075-020-01033-1","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2020,10,29]]},"assertion":[{"value":"11 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}