{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T02:23:43Z","timestamp":1773800623856,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,11,13]],"date-time":"2017-11-13T00:00:00Z","timestamp":1510531200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,11,13]],"date-time":"2017-11-13T00:00:00Z","timestamp":1510531200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["(B) 15K15941"],"award-info":[{"award-number":["(B) 15K15941"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["(B)24310112"],"award-info":[{"award-number":["(B)24310112"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["(C) 26330025"],"award-info":[{"award-number":["(C) 26330025"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["(B)26280005"],"award-info":[{"award-number":["(B)26280005"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10107-017-1207-7","type":"journal-article","created":{"date-parts":[[2017,11,13]],"date-time":"2017-11-13T13:34:54Z","timestamp":1510580094000},"page":"117-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An extension of Chubanov\u2019s algorithm to symmetric cones"],"prefix":"10.1007","volume":"173","author":[{"given":"Bruno F.","family":"Louren\u00e7o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomonari","family":"Kitahara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masakazu","family":"Muramatsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Tsuchiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,13]]},"reference":[{"issue":"1","key":"1207_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F Alizadeh","year":"2003","unstructured":"Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95(1), 3\u201351 (2003)","journal-title":"Math. Program."},{"issue":"3","key":"1207_CR2","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1287\/moor.1080.0319","volume":"33","author":"VL Basescu","year":"2008","unstructured":"Basescu, V.L., Mitchell, J.E.: An analytic center cutting plane approach for conic programming. Math. Oper. Res. 33(3), 529\u2013551 (2008)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1207_CR3","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10107-011-0445-3","volume":"134","author":"S Chubanov","year":"2012","unstructured":"Chubanov, S.: A strongly polynomial algorithm for linear systems having a binary solution. Math. Program. 134(2), 533\u2013570 (2012)","journal-title":"Math. Program."},{"issue":"2","key":"1207_CR4","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s10107-014-0823-8","volume":"153","author":"S Chubanov","year":"2015","unstructured":"Chubanov, S.: A polynomial projection algorithm for linear feasibility problems. Math. Program. 153(2), 687\u2013713 (2015)","journal-title":"Math. Program."},{"key":"1207_CR5","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534778.001.0001","volume-title":"Analysis on Symmetric Cones. Oxford Mathematical Monographs","author":"J Faraut","year":"1994","unstructured":"Faraut, J., Kor\u00e1nyi, A.: Analysis on Symmetric Cones. Oxford Mathematical Monographs. Clarendon Press, Oxford (1994)"},{"issue":"4","key":"1207_CR6","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1023\/A:1009701824047","volume":"1","author":"L Faybusovich","year":"1997","unstructured":"Faybusovich, L.: Euclidean Jordan algebras and interior-point algorithms. Positivity 1(4), 331\u2013357 (1997)","journal-title":"Positivity"},{"issue":"1","key":"1207_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s002090100286","volume":"239","author":"L Faybusovich","year":"2002","unstructured":"Faybusovich, L.: A Jordan-algebraic approach to potential-reduction algorithms. Math. Z. 239(1), 117\u2013129 (2002)","journal-title":"Math. Z."},{"issue":"3","key":"1207_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1080\/02331930701523510","volume":"57","author":"L Faybusovich","year":"2008","unstructured":"Faybusovich, L.: Several Jordan-algebraic aspects of optimization. Optimization 57(3), 379\u2013393 (2008)","journal-title":"Optimization"},{"issue":"5","key":"1207_CR9","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1080\/1055678021000060829a","volume":"17","author":"J-L Goffin","year":"2002","unstructured":"Goffin, J.-L., Vial, J.-P.: Convex nondifferentiable optimization: a survey focused on the analytic center cutting plane method. Optim. Methods Softw. 17(5), 805\u2013867 (2002)","journal-title":"Optim. Methods Softw."},{"key":"1207_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01350642","volume":"186","author":"U Hirzerbruch","year":"1970","unstructured":"Hirzerbruch, U.: Der min\u2013max-satz von E. Fischer f\u00fcr formal-reelle Jordan-algebren. Math. Ann. 186, 65\u201369 (1970)","journal-title":"Math. Ann."},{"issue":"4","key":"1207_CR11","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373\u2013395 (1984)","journal-title":"Combinatorica"},{"issue":"1","key":"1207_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0041-5553(80)90061-0","volume":"20","author":"L Khachiyan","year":"1980","unstructured":"Khachiyan, L.: Polynomial algorithms in linear programming. USSR Comput. Math. Math. Phys. 20(1), 53\u201372 (1980)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1207_CR13","doi-asserted-by":"publisher","unstructured":"Kitahara, T., Tsuchiya, T.: An extension of Chubanov\u2019s polynomial-time linear programming algorithm to second-order cone programming. Optim. Methods Softw. (2017). https:\/\/doi.org\/10.1080\/10556788.2017.1382495","DOI":"10.1080\/10556788.2017.1382495"},{"key":"1207_CR14","unstructured":"Li, D., Roos, K., Terlaky, T.: A polynomial column-wise rescaling von Neumann algorithm. Optimization Online. http:\/\/www.optimization-online.org\/DB_HTML\/2015\/06\/4979.html (June 2015)"},{"key":"1207_CR15","unstructured":"Luo, Z., Sturm, J.F., Zhang, S.: Duality results for conic convex programming. Technical Report, Econometric Institute, Erasmus University Rotterdam, The Netherlands (1997)"},{"issue":"2","key":"1207_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/A:1008787027641","volume":"15","author":"Z-Q Luo","year":"2000","unstructured":"Luo, Z.-Q., Sun, J.: A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities. Comput. Optim. Appl. 15(2), 167\u2013191 (2000)","journal-title":"Comput. Optim. Appl."},{"key":"1207_CR17","unstructured":"Maxima: Maxima, a computer algebra system. Version 5.36.1. http:\/\/maxima.sourceforge.net\/ (2015)"},{"issue":"1","key":"1207_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/PL00011378","volume":"88","author":"RD Monteiro","year":"2000","unstructured":"Monteiro, R.D., Tsuchiya, T.: Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions. Math. Program. 88(1), 61\u201383 (2000)","journal-title":"Math. Program."},{"issue":"3","key":"1207_CR19","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1023\/A:1017920200889","volume":"112","author":"M Muramatsu","year":"2002","unstructured":"Muramatsu, M.: On a commutative class of search directions for linear programming over symmetric cones. J. Optim. Theory Appl. 112(3), 595\u2013625 (2002)","journal-title":"J. Optim. Theory Appl."},{"key":"1207_CR20","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1017\/S0962492906370018","volume":"17","author":"AS Nemirovski","year":"2008","unstructured":"Nemirovski, A.S., Todd, M.J.: Interior-point methods for optimization. Acta Numer. 17, 191\u2013234 (2008)","journal-title":"Acta Numer."},{"key":"1207_CR21","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. Society for Industrial and Applied Mathematics, Philadelphia (1994)"},{"issue":"1","key":"1207_CR22","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1287\/moor.1040.0116","volume":"30","author":"MR Oskoorouchi","year":"2005","unstructured":"Oskoorouchi, M.R., Goffin, J.-L.: An interior point cutting plane method for the convex feasibility problem with second-order cone inequalities. Math. Oper. Res. 30(1), 127\u2013149 (2005)","journal-title":"Math. Oper. Res."},{"key":"1207_CR23","unstructured":"Pe\u00f1a, J., Soheili, N.: Solving conic systems via projection and rescaling. Mathematical Programming, e-prints (to appear) (Dec. 2015). arXiv:1512.06154"},{"key":"1207_CR24","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1997","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1997)"},{"key":"1207_CR25","unstructured":"Roos, K.: An improved version of Chubanov\u2019s method for solving a homogeneous feasibility problem. Optimization Online. http:\/\/www.optimization-online.org\/DB_HTML\/2016\/11\/5745.html (2016)"},{"issue":"3","key":"1207_CR26","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10107-003-0380-z","volume":"96","author":"S Schmieta","year":"2003","unstructured":"Schmieta, S., Alizadeh, F.: Extension of primal-dual interior point algorithms to symmetric cones. Math. Program. 96(3), 409\u2013438 (2003)","journal-title":"Math. Program."},{"issue":"2","key":"1207_CR27","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1137\/110848955","volume":"22","author":"N Soheili","year":"2012","unstructured":"Soheili, N., Pe\u00f1a, J.: A smooth perceptron algorithm. SIAM J. Optim. 22(2), 728\u2013737 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1\u20133","key":"1207_CR28","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0024-3795(00)00096-3","volume":"312","author":"JF Sturm","year":"2000","unstructured":"Sturm, J.F.: Similarity and other spectral relations for symmetric cones. Linear Algebra Appl. 312(1\u20133), 135\u2013154 (2000)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"1207_CR29","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1287\/moor.27.2.332.327","volume":"27","author":"J Sun","year":"2002","unstructured":"Sun, J., Toh, K.-C., Zhao, G.: An analytic center cutting plane method for semidefinite feasibility problems. Math. Oper. Res. 27(2), 332\u2013346 (2002)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1207_CR30","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1137\/S1052623400370503","volume":"12","author":"K-C Toh","year":"2002","unstructured":"Toh, K.-C., Zhao, G., Sun, J.: A multiple-cut analytic center cutting plane method for semidefinite feasibility problems. SIAM J. Optim. 12(4), 1126\u20131146 (2002)","journal-title":"SIAM J. Optim."},{"issue":"1\u20134","key":"1207_CR31","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1080\/10556789908805750","volume":"11","author":"T Tsuchiya","year":"1999","unstructured":"Tsuchiya, T.: A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming. Optim. Methods Softw. 11(1\u20134), 141\u2013182 (1999)","journal-title":"Optim. Methods Softw."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1207-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1207-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1207-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T16:14:53Z","timestamp":1719591293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1207-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,13]]},"references-count":31,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["1207"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1207-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,13]]},"assertion":[{"value":"5 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}