{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:51Z","timestamp":1740122691067,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,9,10]],"date-time":"2016-09-10T00:00:00Z","timestamp":1473465600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,9,10]],"date-time":"2016-09-10T00:00:00Z","timestamp":1473465600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Airforce Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-15-1-0222"],"award-info":[{"award-number":["FA9550-15-1-0222"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10589-016-9874-5","type":"journal-article","created":{"date-parts":[[2016,9,10]],"date-time":"2016-09-10T12:17:03Z","timestamp":1473509823000},"page":"577-600","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A polynomial primal-dual affine scaling algorithm for symmetric conic optimization"],"prefix":"10.1007","volume":"66","author":[{"given":"Ali","family":"Mohammad-Nezhad","sequence":"first","affiliation":[]},{"given":"Tam\u00e1s","family":"Terlaky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,10]]},"reference":[{"key":"9874_CR1","unstructured":"Alizadeh, F., Schmieta, S.H.: Optimization with semidefinite, quadratic and linear constraints. Technical report RRR 23-97, RUTCOR, Rutgers University, New Brunswick (1997)"},{"key":"9874_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-1-4615-4381-7_8","volume-title":"Handbook on Semidefinite Programming","author":"F Alizadeh","year":"2000","unstructured":"Alizadeh, F., Schmieta, S.: Symmetric cones, potential reduction methods and word-by-word extensions. In: Wolkowicz, H., Saigal, S., Vandenberghe, L. (eds.) Handbook on Semidefinite Programming, pp. 195\u2013233. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"9874_CR3","series-title":"MPS\/SIAM Series on Optimization","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovskii, A.: Lectures on Modern Convex Optimization. MPS\/SIAM Series on Optimization. SIAM, Philadelphia (2001)"},{"key":"9874_CR4","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 University Press, Oxford (1994)"},{"issue":"4","key":"9874_CR5","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":"9874_CR6","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."},{"key":"9874_CR7","series-title":"SIAM Classics in Applied Mathematics","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971316","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"AV Fiacco","year":"1990","unstructured":"Fiacco, A.V., McCormick, G.P.: Nonlinear Programming: Sequential Unconstrained Minimization Techniques. SIAM Classics in Applied Mathematics. SIAM Publications, Philadelphia (1990)"},{"key":"9874_CR8","series-title":"Memorandum","volume-title":"The logarithmic potential method for solving linear programming problems","author":"KR Frisch","year":"1955","unstructured":"Frisch, K.R.: The logarithmic potential method for solving linear programming problems. Memorandum. University Institute of Economics, Oslo (1955)"},{"key":"9874_CR9","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1137\/S105262349630009X","volume":"8","author":"D Goldfarb","year":"1998","unstructured":"Goldfarb, D., Scheinberg, K.: Interior point trajectories in semidefinite programming. SIAM J. Optim. 8, 871\u2013886 (1998)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9874_CR10","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.ejor.2011.02.022","volume":"214","author":"G Gu","year":"2011","unstructured":"Gu, G., Zangiabadi, M., Roos, C.: Full Nesterov\u2013Todd step infeasible interior-point method for symmetric optimization. Eur. J. Oper. Res. 214(3), 473\u2013484 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9874_CR11","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1287\/moor.21.4.860","volume":"21","author":"O G\u00fcler","year":"1996","unstructured":"G\u00fcler, O.: Barrier functions in interior point methods. Math. Oper. Res. 21(4), 860\u2013885 (1996)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9874_CR12","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1287\/moor.21.2.341","volume":"21","author":"B Jansen","year":"1996","unstructured":"Jansen, B., Roos, C., Terlaky, T.: A Polynomial primal-dual Dikin-type algorithm for linear programming. Math. Oper. Res. 21(2), 341\u2013353 (1996)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"9874_CR13","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":"9874_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1009791827917","volume":"2","author":"E de Klerk","year":"1998","unstructured":"de Klerk, E., Roos, C., Terlaky, T.: Polynomial primal-dual affine scaling algorithms in semidefinite programming. J. Comb. Optim. 2(1), 51\u201369 (1998)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"9874_CR15","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10107-002-0355-5","volume":"95","author":"HD Mittelmann","year":"2003","unstructured":"Mittelmann, H.D.: An independent benchmarking of SDP and SOCP solvers. Math. Program. 95(2), 407\u2013430 (2003)","journal-title":"Math. Program."},{"issue":"2","key":"9874_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1287\/moor.15.2.191","volume":"15","author":"RD Monteiro","year":"1990","unstructured":"Monteiro, R.D., Adler, I., Resende, M.G.: A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension. Math. Oper. Res. 15(2), 191\u2013214 (1990)","journal-title":"Math. Oper. Res."},{"key":"9874_CR17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Point Polynomial Methods in Convex Programming: Theory and Applications","author":"YE Nesterov","year":"1994","unstructured":"Nesterov, Y.E., Nemirovskii, A.: Interior Point Polynomial Methods in Convex Programming: Theory and Applications. SIAM, Philadelphia (1994)"},{"issue":"1","key":"9874_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"YE Nesterov","year":"1997","unstructured":"Nesterov, Y.E., Todd, M.J.: Self-scaled barriers and interior point methods for convex programming. Math. Oper. Res. 22(1), 1\u201342 (1997)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9874_CR19","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1137\/S1052623495290209","volume":"8","author":"YE Nesterov","year":"1998","unstructured":"Nesterov, Y.E., Todd, M.J.: Primal-dual interior point methods for self-scaled cones. SIAM J. Optim. 8(2), 324\u2013364 (1998)","journal-title":"SIAM J. Optim."},{"key":"9874_CR20","series-title":"Princeton Series in Applied Mathematics","volume-title":"Self-Regularity: A New Paradigm for Primal-Dual Interior Point Algorithms","author":"J Peng","year":"2002","unstructured":"Peng, J., Roos, C., Terlaky, T.: Self-Regularity: A New Paradigm for Primal-Dual Interior Point Algorithms. Princeton Series in Applied Mathematics. Princeton University Press, Princeton (2002)"},{"issue":"4","key":"9874_CR21","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1137\/040606557","volume":"16","author":"BK Rangarajan","year":"2006","unstructured":"Rangarajan, B.K.: Polynomial convergence of infeasible-interior point methods over symmetric cones. SIAM J. Optim. 16(4), 1211\u20131229 (2006)","journal-title":"SIAM J. Optim."},{"key":"9874_CR22","unstructured":"Schmieta, S.H.: Application of Jordan Algebras to the design and analysis of interior-point algorithms for linear, quadratically constrained quadratic, and semidefinite programming. PhD Thesis, RUTCOR, Rutgers University, New Brunswick (1999)"},{"key":"9874_CR23","unstructured":"Schmieta, S.H., Alizadeh, F.: Extension of commutative class of primal-dual interior-point algorithms to symmetric cones. Technical Report RRR 13-99, RUTCOR, Rutgers University, New Brunswick (1999)"},{"issue":"3","key":"9874_CR24","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1287\/moor.26.3.543.10582","volume":"26","author":"SH Schmieta","year":"2001","unstructured":"Schmieta, S.H., Alizadeh, F.: Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones. Math. Oper. Res. 26(3), 543\u2013564 (2001)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"9874_CR25","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10107-003-0380-z","volume":"96","author":"SH Schmieta","year":"2003","unstructured":"Schmieta, S.H., Alizadeh, F.: Extension of polynomial time interior-point algorithms to symmetric cones. Math. Program. 96(3), 409\u2013438 (2003)","journal-title":"Math. Program."},{"issue":"1\u20134","key":"9874_CR26","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11(1\u20134), 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"9874_CR27","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 and Its Applications 312(1), 135\u2013154 (2000)","journal-title":"Linear Algebra and Its Applications"},{"key":"9874_CR28","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/120890880","volume":"24","author":"T Terlaky","year":"2014","unstructured":"Terlaky, T., Wang, Z.: On the identification of the optimal partition of second order cone optimization problems. SIAM J. Optim. 24, 385\u2013414 (2014)","journal-title":"SIAM J. Optim."},{"issue":"1\u20134","key":"9874_CR29","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: SDPT3 - A Matlab software package for semidefinite programming, version 1.3. Optim. Methods Softw. 11(1\u20134), 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"9874_CR30","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(2), 189\u2013217 (2003)","journal-title":"Math. Program."},{"issue":"2","key":"9874_CR31","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1137\/S1052623495296115","volume":"8","author":"Y Zhang","year":"1998","unstructured":"Zhang, Y.: On extending primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8(2), 356\u2013386 (1998)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9874-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-016-9874-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9874-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T09:08:38Z","timestamp":1718788118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-016-9874-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,10]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["9874"],"URL":"https:\/\/doi.org\/10.1007\/s10589-016-9874-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2016,9,10]]},"assertion":[{"value":"5 September 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2016","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}