{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:11:28Z","timestamp":1761808288947,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T00:00:00Z","timestamp":1551657600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["71471102"],"award-info":[{"award-number":["71471102"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Excellent Foundation of Graduate Student of China Three Gorges University","award":["2017YPY082"],"award-info":[{"award-number":["2017YPY082"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s11590-019-01414-z","type":"journal-article","created":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T11:14:05Z","timestamp":1551698045000},"page":"1157-1175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A primal-dual interior-point algorithm with arc-search for semidefinite programming"],"prefix":"10.1007","volume":"13","author":[{"given":"Mingwang","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Beibei","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Yiyuan","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Xiaoyu","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Zhengwei","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,4]]},"reference":[{"key":"1414_CR1","unstructured":"Alizadeh, F.: Combinatorial optimization with interior-point methods and semi-definite matrices. Ph.D. thesis, Computer Science Department, University of Minnesota, Minneapolis, MN (1991)"},{"key":"1414_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970777","volume-title":"Linear Matrix Inequalities in System and Control Theory","author":"S Boyd","year":"1994","unstructured":"Boyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory. SIAM, Philadelphia (1994)"},{"key":"1414_CR3","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1137\/0802007","volume":"2","author":"M Overton","year":"1992","unstructured":"Overton, M.: Large-scale optimization of eigenvalues. SIAM J. Optim. 2, 88\u2013120 (1992)","journal-title":"SIAM J. Optim."},{"key":"1414_CR4","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-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":"1414_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1137\/S1052623495290209","volume":"8","author":"Y Nesterov","year":"1998","unstructured":"Nesterov, Y., Todd, M.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8, 256\u2013268 (1998)","journal-title":"SIAM J. Optim."},{"key":"1414_CR6","first-page":"205","volume":"69","author":"L Vandenberghe","year":"1995","unstructured":"Vandenberghe, L., Boyd, S.: A primal-dual potential reduction method for problems involving matrix inequalities. Math. Program. 69, 205\u2013236 (1995)","journal-title":"Math. Program."},{"key":"1414_CR7","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1137\/S1052623494266869","volume":"6","author":"P Hung","year":"1996","unstructured":"Hung, P., Ye, Y.: An asymptotocal \n                    \n                      \n                    \n                    $$O(\\sqrt{n}L)$$\n                    \n                      \n                        \n                          O\n                          (\n                          \n                            n\n                          \n                          L\n                          )\n                        \n                      \n                    \n                  -iteration path-following linear programming algorithm that use wide neighborhoods. SIAM J. Optim. 6, 570\u2013586 (1996)","journal-title":"SIAM J. Optim."},{"key":"1414_CR8","first-page":"117","volume":"76","author":"B Jansen","year":"1996","unstructured":"Jansen, B., Roos, C., Terlaky, T.: Improved complexity using higher-order correctors for primal-dual Dikin affine scaling. Math. Program. 76, 117\u2013130 (1996)","journal-title":"Math. Program."},{"key":"1414_CR9","unstructured":"Yang, Y.: Arc-search path-following interior-point algorithms for linear programming. Optimization Oline (2009). \n                    http:\/\/www.optimization-online.org\/ARCHIVE_CAT\/LINSDP\/2009.html"},{"key":"1414_CR10","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 algorithms for linear programming. J. Optim. Theory. Appl. 158, 859\u2013873 (2013)","journal-title":"J. Optim. Theory. Appl."},{"key":"1414_CR11","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1007\/s11075-016-0180-1","volume":"74","author":"Y Yang","year":"2017","unstructured":"Yang, Y.: CurveLP-A MATLAB implementation of an infeasible interior-point algorithm for linear programming. Numer. Algorithms 74, 967\u2013996 (2017)","journal-title":"Numer. Algorithms"},{"key":"1414_CR12","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 algorithms for convex quadratic programming. Eur. J. Oper. Res. 215, 25\u201338 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"1414_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1287\/moor.15.2.191","volume":"15","author":"R Monteiro","year":"1990","unstructured":"Monteiro, R., Adler, I.: A polynominal-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension. Math. Oper. Res. 15, 191\u2013214 (1990)","journal-title":"Math. Oper. Res."},{"key":"1414_CR14","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s12190-015-0900-z","volume":"51","author":"XM Yang","year":"2016","unstructured":"Yang, X.M., Zhang, Y.K., Liu, H.M.: A wide neighborhood infeasible-interior-point method with arc-search for linear programming. J. Comput. Math. Appl. 51, 209\u2013225 (2016)","journal-title":"J. Comput. Math. Appl."},{"key":"1414_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s11590-016-0997-5","volume":"11","author":"XM Yang","year":"2017","unstructured":"Yang, X.M., Liu, H.W., Zhang, Y.K.: 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":"1414_CR16","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s11590-017-1142-9","volume":"12","author":"YG Yang","year":"2018","unstructured":"Yang, Y.G., Yamashita, M.: An arc-search \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 programming. Optim. Lett. 12, 781\u2013798 (2018)","journal-title":"Optim. Lett."},{"key":"1414_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10288-016-0325-z","volume":"15","author":"M Pirhaji","year":"2017","unstructured":"Pirhaji, M., Zangiabadi, M., Mansouri, H.: An \n                    \n                      \n                    \n                    $$l_2$$\n                    \n                      \n                        \n                          l\n                          2\n                        \n                      \n                    \n                  -neighborhood infeasible interior-point algorithm for linear complementarity problems. 4OR-Q. J. Oper. Res. 15, 111\u2013131 (2017)","journal-title":"4OR-Q. J. Oper. Res."},{"key":"1414_CR18","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                    \n                      \n                    \n                    $$N_{\\infty }^{-}(\\gamma )$$\n                    \n                      \n                        \n                          \n                            N\n                            \n                              \u221e\n                            \n                            -\n                          \n                          \n                            (\n                            \u03b3\n                            )\n                          \n                        \n                      \n                    \n                   neighborhood for symmetric optimization. Fund. Inform. 146, 255\u2013269 (2016)","journal-title":"Fund. Inform."},{"key":"1414_CR19","first-page":"2271","volume":"94","author":"B Kheirfam","year":"2017","unstructured":"Kheirfam, B.: An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the \n                    \n                      \n                    \n                    $$N_{\\infty }^{-}(\\gamma )$$\n                    \n                      \n                        \n                          \n                            N\n                            \n                              \u221e\n                            \n                            -\n                          \n                          \n                            (\n                            \u03b3\n                            )\n                          \n                        \n                      \n                    \n                   neighbourhood of the central path: Int. J. Comput. Math. 94, 2271\u20132282 (2017)","journal-title":"J. Comput. Math."},{"key":"1414_CR20","doi-asserted-by":"publisher","first-page":"261","DOI":"10.3934\/naco.2018015","volume":"2","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. 2, 261\u2013275 (2018)","journal-title":"Numer. Algebra Control Optim."},{"key":"1414_CR21","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s11590-017-1142-9","volume":"12","author":"Y Yang","year":"2018","unstructured":"Yang, Y.: Two computationally efficient polynomial iteration infeasible interior-point algorithm for linear programming. Numer. Algorithm Optim. Lett. 12, 781\u2013798 (2018)","journal-title":"Numer. Algorithm Optim. Lett."},{"key":"1414_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/b105286","volume-title":"Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications","author":"E Klerk de","year":"2002","unstructured":"de Klerk, E.: Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"1414_CR23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-point polynomial algorithms in convex programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-point polynomial algorithms in convex programming. SIAM, Philadelphia (1994)"},{"key":"1414_CR24","first-page":"281","volume":"81","author":"RDC Monterio","year":"1998","unstructured":"Monterio, R.D.C., Yin, Z.: A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming. Math. Program. 81, 281\u2013299 (1998)","journal-title":"Math. Program."},{"key":"1414_CR25","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."},{"key":"1414_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"Y Nesterov","year":"1997","unstructured":"Nesterov, Y., Todd, M.: Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22, 1\u201342 (1997)","journal-title":"Math. Oper. Res."},{"key":"1414_CR27","unstructured":"Yang, X.M., Liu, H.W.: Study on wide neighborhood in interior-point method for symmetric cone programming. Xidian University Dissertation, P. R. China (2014)"},{"key":"1414_CR28","unstructured":"Koulaei, M.H., Terlaky, T.: On the extension of a Mehrotra-type algorithm for semidefinit optimization. Technical Report 2007\/4, Advanced optimization Lab., Department of Computingand Software, McMaster University, Hamilton, Ontario, Canada"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01414-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-019-01414-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01414-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T19:19:37Z","timestamp":1583176777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-019-01414-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,4]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["1414"],"URL":"https:\/\/doi.org\/10.1007\/s11590-019-01414-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2019,3,4]]},"assertion":[{"value":"3 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}