{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T10:59:49Z","timestamp":1772276389597,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T00:00:00Z","timestamp":1587945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T00:00:00Z","timestamp":1587945600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"crossref","award":["16K16357"],"award-info":[{"award-number":["16K16357"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]},{"name":"JST CREST","award":["JPMJCR14D2"],"award-info":[{"award-number":["JPMJCR14D2"]}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"crossref","award":["15K15943"],"award-info":[{"award-number":["15K15943"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"crossref","award":["19K15247"],"award-info":[{"award-number":["19K15247"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s11075-020-00933-6","type":"journal-article","created":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T11:03:03Z","timestamp":1587985383000},"page":"1285-1302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Extension of the LP-Newton method to conic programming problems via semi-infinite representation"],"prefix":"10.1007","volume":"86","author":[{"given":"Mirai","family":"Tanaka","sequence":"first","affiliation":[]},{"given":"Takayuki","family":"Okuno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,27]]},"reference":[{"key":"933_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization. SIAM (2001)","DOI":"10.1137\/1.9780898718829"},{"key":"933_CR2","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)","DOI":"10.1017\/CBO9780511804441"},{"key":"933_CR3","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10107-002-0306-1","volume":"95","author":"X Chen","year":"2003","unstructured":"Chen, X., Tseng, P.: Non-interior continuation methods for solving semidefinite complementarity problems. Math. Program. 95, 431\u2013474 (2003)","journal-title":"Math. Program."},{"key":"933_CR4","doi-asserted-by":"crossref","unstructured":"Faraut, J., Koranyi, A.: Analysis on Symmetric Cones. Oxford University Press, Oxford (1994)","DOI":"10.1093\/oso\/9780198534778.001.0001"},{"key":"933_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s11081-008-9067-x","volume":"10","author":"S Fujishige","year":"2009","unstructured":"Fujishige, S., Hayashi, T., Yamashita, K., Zimmermann, U.: Zonotopes and the LP-Newton method. Optim. Eng. 10, 193\u2013205 (2009)","journal-title":"Optim. Eng."},{"key":"933_CR6","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1080\/10556788.2015.1121487","volume":"31","author":"S Hayashi","year":"2016","unstructured":"Hayashi, S., Okuno, T., Ito, Y.: Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation. Optim. Methods Softw. 31, 1272\u20131297 (2016)","journal-title":"Optim. Methods Softw."},{"key":"933_CR7","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1137\/S1052623403421516","volume":"15","author":"S Hayashi","year":"2005","unstructured":"Hayashi, S., Yamashita, N., Fukushima, M.: A combined smoothing and regularization method for monotone second-order cone complementarity problems. SIAM J. Optim. 15, 593\u2013615 (2005)","journal-title":"SIAM J. Optim."},{"key":"933_CR8","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1137\/1035089","volume":"35","author":"R Hettich","year":"1993","unstructured":"Hettich, R., Kortanek, K. O.: Semi-infinite programming: theory, methods, and applications. SIAM Rev. 35, 380\u2013429 (1993)","journal-title":"SIAM Rev."},{"key":"933_CR9","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s10589-008-9180-y","volume":"45","author":"ZH Huang","year":"2010","unstructured":"Huang, Z.H., Ni, T.: Smoothing algorithms for complementarity problems over symmetric cones. Comput. Optim. Appl. 45, 557\u2013579 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"933_CR10","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/j.orl.2013.05.004","volume":"41","author":"T Kitahara","year":"2013","unstructured":"Kitahara, T., Mizuno, S., Shi, J.: The LP-Newton method for standard form linear programming problems. Oper. Res. Lett. 41, 426\u2013429 (2013)","journal-title":"Oper. Res. Lett."},{"key":"933_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00453-018-0436-3","volume":"81","author":"T Kitahara","year":"2019","unstructured":"Kitahara, T., Sukegawa, N.: A simple projection algorithm for linear programming problems. Algorithmica 81, 167\u2013178 (2019)","journal-title":"Algorithmica"},{"key":"933_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556788.2017.1382495","volume":"33","author":"T Kitahara","year":"2018","unstructured":"Kitahara, T., Tsuchiya, T.: An extension of Chubanov\u2019s polynomial-time linear programming algorithm to second-order cone programming. Optim. Methods Softw. 33, 1\u201325 (2018)","journal-title":"Optim. Methods Softw."},{"key":"933_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"MS Lobo","year":"1998","unstructured":"Lobo, M.S., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra Appl. 284, 193\u2013228 (1998)","journal-title":"Linear Algebra Appl."},{"key":"933_CR14","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.ejor.2006.08.045","volume":"180","author":"M L\u00f3pez","year":"2007","unstructured":"L\u00f3pez, M., Still, G.: Semi-infinite programming. Eur. J. Oper. Res. 180, 491\u2013518 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"933_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10107-017-1207-7","volume":"173","author":"BF Louren\u00e7o","year":"2019","unstructured":"Louren\u00e7o, B.F., Kitahara, T., Muramatsu, M., Tsuchiya, T.: An extension of Chubanov\u2019s algorithm to symmetric cones. Math. Program. 173, 117\u2013149 (2019)","journal-title":"Math. Program."},{"key":"933_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/PL00011378","volume":"88","author":"RDC Monteiro","year":"2000","unstructured":"Monteiro, R.D.C., Tsuchiya, T.: Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions. Math. Programm. 88, 61\u201383 (2000)","journal-title":"Math. Programm."},{"key":"933_CR17","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1080\/10556780500094697","volume":"21","author":"M Muramatsu","year":"2006","unstructured":"Muramatsu, M.: A pivoting procedure for a class of second-order cone programming. Optim. Methods Softw. 21, 295\u2013315 (2006)","journal-title":"Optim. Methods Softw."},{"key":"933_CR18","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Nemirovski, A.: Interior-Point Polynomial Methods in Convex Programming. SIAM (1994)","DOI":"10.1137\/1.9781611970791"},{"key":"933_CR19","unstructured":"Silvestri, F., Reinelt, G.: The LP-Newton method and conic optimization. arXiv:1611.09260v2 (2017)"},{"key":"933_CR20","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-014-0773-1","volume":"150","author":"A Skajaa","year":"2015","unstructured":"Skajaa, A., Ye, Y.: A homogeneous interior-point algorithm for nonsymmetric convex conic optimization. Math. Program. 150, 391\u2013422 (2015)","journal-title":"Math. Program."},{"key":"933_CR21","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1017\/S0962492901000071","volume":"10","author":"MJ Todd","year":"2001","unstructured":"Todd, M.J.: Semidefinite optimization. Acta Numer. 10, 515\u2013560 (2001)","journal-title":"Acta Numer."},{"key":"933_CR22","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95, 189\u2013217 (2003)","journal-title":"Math. Program."},{"key":"933_CR23","first-page":"48","volume":"30","author":"DR Wilhelmsen","year":"1976","unstructured":"Wilhelmsen, D.R.: A nearest point algorithm for convex polyhedral cones and applications to positive linear approximation. Math. Comput. 30, 48\u201357 (1976)","journal-title":"Math. Comput."},{"key":"933_CR24","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/BF01580381","volume":"11","author":"P Wolfe","year":"1976","unstructured":"Wolfe, P.: Finding the nearest point in a polytope. Math. Program. 11, 128\u2013149 (1976)","journal-title":"Math. Program."},{"key":"933_CR25","doi-asserted-by":"publisher","first-page":"1969","DOI":"10.1007\/s11590-018-1333-z","volume":"13","author":"V Zhadan","year":"2019","unstructured":"Zhadan, V.: Two-phase simplex method for linear semidefinite optimization. Optim. Lett. 13, 1969\u20131984 (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-00933-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-020-00933-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00933-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T19:23:27Z","timestamp":1722799407000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-020-00933-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,27]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["933"],"URL":"https:\/\/doi.org\/10.1007\/s11075-020-00933-6","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,27]]},"assertion":[{"value":"2 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}