{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T14:50:54Z","timestamp":1763563854382},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T00:00:00Z","timestamp":1383004800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10589-013-9608-x","type":"journal-article","created":{"date-parts":[[2013,10,28]],"date-time":"2013-10-28T20:27:58Z","timestamp":1382992078000},"page":"623-665","source":"Crossref","is-referenced-by-count":8,"title":["Curvature integrals and iteration complexities in SDP and symmetric cone programs"],"prefix":"10.1007","volume":"57","author":[{"given":"Satoshi","family":"Kakihara","sequence":"first","affiliation":[]},{"given":"Atsumi","family":"Ohara","sequence":"additional","affiliation":[]},{"given":"Takashi","family":"Tsuchiya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,29]]},"reference":[{"key":"9608_CR1","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. 191. American Mathematical Society, Providence (2000). Translated from the 1993 Japanese original by Daishi Harada"},{"issue":"1\u20134","key":"9608_CR2","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1080\/10556789908805769","volume":"11\/12","author":"B. Borchers","year":"1999","unstructured":"Borchers, B.: SDPLIB 1.2, library of semidefinite programming test problems. Optim. Methods Softw. 11\/12(1\u20134), 683\u2013690 (1999). Interior point methods","journal-title":"Optim. Methods Softw."},{"key":"9608_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971446","volume-title":"Applied Numerical Linear Algebra","author":"J.W. Demmel","year":"1997","unstructured":"Demmel, J.W.: Applied Numerical Linear Algebra. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1997)"},{"key":"9608_CR4","series-title":"Oxford Mathematical Monographs","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534778.001.0001","volume-title":"Analysis on Symmetric Cones","author":"J. Faraut","year":"1994","unstructured":"Faraut, J., Kor\u00e1nyi, A.: Analysis on Symmetric Cones. Oxford Mathematical Monographs. The Clarendon Press Oxford University Press, New York (1994). Oxford Science Publications."},{"issue":"1","key":"9608_CR5","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-dual interior-point algorithms. J. Comput. Appl. Math. 86(1), 149\u2013175 (1997). Special issue dedicated to William B. Gragg (Monterey, CA, 1996)","journal-title":"J. Comput. Appl. Math."},{"key":"9608_CR6","unstructured":"Kakihara, S., Ohara, A., Tsuchiya, T.: Information geometry and primal-dual interior-point algorithms. Optimization Online (2010)"},{"issue":"3","key":"9608_CR7","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1007\/s10957-012-0180-9","volume":"157","author":"S. Kakihara","year":"2013","unstructured":"Kakihara, S., Ohara, A., Tsuchiya, T.: Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs. J. Optim. Theory Appl. 157(3), 749\u2013780 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"9608_CR8","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 (Brunswick, ME, 1988)","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. 114, pp. 51\u201375. American Mathematical Society, Providence (1990)"},{"issue":"1, Ser. A","key":"9608_CR9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"Monteiro, R.D.C., Adler, I.: Interior path following primal-dual algorithms. I. Linear programming. Math. Program. 44(1, Ser. A), 27\u201341 (1989)","journal-title":"Math. Program."},{"issue":"3","key":"9608_CR10","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/S1052623496312836","volume":"9","author":"R.D.C. Monteiro","year":"1999","unstructured":"Monteiro, R.D.C., Tsuchiya, T.: Polynomial convergence of a new family of primal-dual algorithms for semidefinite programming. SIAM J. Optim. 9(3), 551\u2013577 (1999). (electronic)","journal-title":"SIAM J. Optim."},{"issue":"1, Ser. A","key":"9608_CR11","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 strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms. Math. Program. 115(1, Ser. A), 105\u2013149 (2008)","journal-title":"Math. Program."},{"issue":"3, Ser. A","key":"9608_CR12","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 unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming. Math. Program. 81(3, Ser. A), 281\u2013299 (1998)","journal-title":"Math. Program."},{"issue":"3","key":"9608_CR13","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. Optim. Theory Appl. 112(3), 595\u2013625 (2002)","journal-title":"J. Optim. Theory Appl."},{"key":"9608_CR14","first-page":"1055","volume-title":"Research Memorandum the Institute of Statistical Mathematics","author":"A. Ohara","year":"2007","unstructured":"Ohara, A., Tsuchiya, T.: An information geometric approach to polynomial-time interior-point algorithms: complexity bound via curvature integral. In: Research Memorandum the Institute of Statistical Mathematics, p. 1055 (2007)"},{"issue":"3, Ser. A","key":"9608_CR15","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-dual interior point algorithms to symmetric cones. Math. Program. 96(3, Ser. A), 409\u2013438 (2003)","journal-title":"Math. Program."},{"issue":"3, Ser. B","key":"9608_CR16","first-page":"527","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. B), 527\u2013553 (1992). 1991. Interior point methods for linear programming: theory and practice (Scheveningen, 1990)","journal-title":"Math. Program."},{"issue":"3","key":"9608_CR17","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1137\/S105262349630060X","volume":"8","author":"M.J. Todd","year":"1998","unstructured":"Todd, M.J., Toh, K.C., T\u00fct\u00fcnc\u00fc, R.H.: On the Nesterov-Todd direction in semidefinite programming. SIAM J. Optim. 8(3), 769\u2013796 (1998) (electronic)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9608_CR18","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."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9608-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-013-9608-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9608-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T23:47:49Z","timestamp":1716076069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-013-9608-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,29]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9608"],"URL":"https:\/\/doi.org\/10.1007\/s10589-013-9608-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,29]]}}}