{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T15:18:29Z","timestamp":1776352709359,"version":"3.51.2"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,10,26]],"date-time":"2012-10-26T00:00:00Z","timestamp":1351209600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s10957-012-0180-9","type":"journal-article","created":{"date-parts":[[2012,10,25]],"date-time":"2012-10-25T18:55:02Z","timestamp":1351191302000},"page":"749-780","source":"Crossref","is-referenced-by-count":17,"title":["Information Geometry and Interior-Point Algorithms in Semidefinite Programs and Symmetric Cone Programs"],"prefix":"10.1007","volume":"157","author":[{"given":"Satoshi","family":"Kakihara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsumi","family":"Ohara","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":[[2012,10,26]]},"reference":[{"key":"180_CR1","unstructured":"Kakihara, S., Ohara, A., Tsuchiya, T.: Curvature integrals and iteration complexities in SDP and symmetric cone programs. Comput. Optim. Appl. (submitted)"},{"key":"180_CR2","series-title":"Contemp. Math.","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1090\/conm\/114\/1097865","volume-title":"Mathematical Developments Arising from Linear Programming","author":"N. Karmarkar","year":"1990","unstructured":"Karmarkar, N.: Riemannian geometry underlying interior-point methods for linear programming. In: Mathematical Developments Arising from Linear Programming, Brunswick, ME, 1988. Contemp. Math., vol.\u00a0114, pp.\u00a051\u201375. Am. Math. Soc., Providence (1990)"},{"issue":"3, Ser.\u00a0B","key":"180_CR3","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/BF01582904","volume":"52","author":"G. Sonnevend","year":"1992","unstructured":"Sonnevend, G., Stoer, J., Zhao, G.: On the complexity of following the central path of linear programs by linear extrapolation. II. Math. Program. 52(3, Ser.\u00a0B), 527\u2013553 (1992). Interior point methods for linear programming: theory and practice (Scheveningen, 1990)","journal-title":"Math. Program."},{"issue":"1","key":"180_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF01182599","volume":"27","author":"G. Zhao","year":"1993","unstructured":"Zhao, G., Stoer, J.: Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals. Appl. Math. Optim. 27(1), 85\u2013103 (1993)","journal-title":"Appl. Math. Optim."},{"issue":"1, Ser.\u00a0A","key":"180_CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s10107-007-0141-5","volume":"115","author":"R.D.C. Monteiro","year":"2008","unstructured":"Monteiro, R.D.C., Tsuchiya, T.: A\u00a0strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal\u2013dual path-following LP algorithms. Math. Program. 115(1, Ser.\u00a0A), 105\u2013149 (2008)","journal-title":"Math. Program."},{"key":"180_CR6","unstructured":"Ohara, A., Tsuchiya, T.: An information geometric approach to polynomial-time interior-point algorithms: complexity bound via curvature integral. Research Memorandum, The Institute of Statistical Mathematics 1055 (2007)"},{"key":"180_CR7","unstructured":"Nagaoka, H., Amari, S.-I.: Differential geometry of smooth families of probability distributions. Mathematical Engineering Technical Reports, Department of Mathematical Engineering and Instrumentation Physics, University of Tokyo (1982)"},{"key":"180_CR8","series-title":"Translations of Mathematical Monographs","volume-title":"Methods of Information Geometry","author":"S.-I. Amari","year":"2000","unstructured":"Amari, S.-I., Nagaoka, H.: Methods of Information Geometry. Translations of Mathematical Monographs, vol.\u00a0191. Am. Math. Soc., Providence (2000). Translated from the 1993 Japanese original by Daishi Harada"},{"key":"180_CR9","unstructured":"Tanabe, K.: Center flattening transformation and a centered newton method for linear programming. Manuscript presented at MP Seminar, The Operations Research, Society of Japan (1987)"},{"key":"180_CR10","first-page":"32","volume":"303","author":"K. Tanabe","year":"1988","unstructured":"Tanabe, K., Tsuchiya, T.: New geometry of linear programming. Suurikagaku 303, 32\u201337 (1988) (in Japanese)","journal-title":"Suurikagaku"},{"key":"180_CR11","unstructured":"Tanabe, K.: Centered newton methods and differential geometry of optimization. Cooperative Research Report, The Institute of Statistical Mathematics 89 (1996)"},{"key":"180_CR12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0024-3795(94)00348-3","volume":"247","author":"A. Ohara","year":"1996","unstructured":"Ohara, A., Suda, N., Amari, S.-I.: Dualistic differential geometry of positive definite matrices and its applications to related problems. Linear Algebra Appl. 247, 31\u201353 (1996)","journal-title":"Linear Algebra Appl."},{"key":"180_CR13","series-title":"SIAM Studies in Applied Mathematics","doi-asserted-by":"crossref","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 Studies in Applied Mathematics, vol.\u00a013. SIAM, Philadelphia (1994)"},{"key":"180_CR14","volume-title":"Optimization Online","author":"S. Kakihara","year":"2010","unstructured":"Kakihara, S., Ohara, A., Tsuchiya, T.: Information geometry and primal\u2013dual interior-point algorithms. In: Optimization Online (2010)"},{"issue":"3, Ser.\u00a0A","key":"180_CR15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01580085","volume":"81","author":"R.D.C. Monteiro","year":"1998","unstructured":"Monteiro, R.D.C., Zhang, Y.: A\u00a0unified analysis for a class of long-step primal\u2013dual path-following interior-point algorithms for semidefinite programming. Math. Program. 81(3, Ser.\u00a0A), 281\u2013299 (1998)","journal-title":"Math. Program."},{"issue":"1","key":"180_CR16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0377-0427(97)00153-2","volume":"86","author":"L. Faybusovich","year":"1997","unstructured":"Faybusovich, L.: Linear systems in Jordan algebras and primal\u2013dual interior-point algorithms. J.\u00a0Comput. Appl. Math. 86(1), 149\u2013175 (1997). Special issue dedicated to William B. Gragg (Monterey, CA, 1996)","journal-title":"J.\u00a0Comput. Appl. Math."},{"issue":"3","key":"180_CR17","doi-asserted-by":"crossref","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.\u00a0Optim. Theory Appl. 112(3), 595\u2013625 (2002)","journal-title":"J.\u00a0Optim. Theory Appl."},{"issue":"3, Ser.\u00a0A","key":"180_CR18","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10107-003-0380-z","volume":"96","author":"S.H. Schmieta","year":"2003","unstructured":"Schmieta, S.H., Alizadeh, F.: Extension of primal\u2013dual interior point algorithms to symmetric cones. Math. Program. 96(3, Ser.\u00a0A), 409\u2013438 (2003)","journal-title":"Math. Program."},{"issue":"1, Ser.\u00a0A","key":"180_CR19","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02592148","volume":"74","author":"S.A. Vavasis","year":"1996","unstructured":"Vavasis, S.A., Ye, Y.: A\u00a0primal\u2013dual interior point method whose running time depends only on the constraint matrix. Math. Program. 74(1, Ser.\u00a0A), 79\u2013120 (1996)","journal-title":"Math. Program."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-012-0180-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-012-0180-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-012-0180-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:55:19Z","timestamp":1559469319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-012-0180-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,26]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["180"],"URL":"https:\/\/doi.org\/10.1007\/s10957-012-0180-9","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,26]]}}}