{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:35:11Z","timestamp":1767141311683,"version":"build-2238731810"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,12,17]],"date-time":"2014-12-17T00:00:00Z","timestamp":1418774400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10957-014-0696-2","type":"journal-article","created":{"date-parts":[[2014,12,16]],"date-time":"2014-12-16T11:12:52Z","timestamp":1418728372000},"page":"588-604","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Improved Complexity Analysis of Full Nesterov\u2013Todd Step Feasible Interior-Point Method for Symmetric Optimization"],"prefix":"10.1007","volume":"166","author":[{"given":"G. Q.","family":"Wang","sequence":"first","affiliation":[]},{"given":"L. C.","family":"Kong","sequence":"additional","affiliation":[]},{"given":"J. Y.","family":"Tao","sequence":"additional","affiliation":[]},{"given":"G.","family":"Lesaja","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,17]]},"reference":[{"issue":"2","key":"696_CR1","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1137\/S1052623495296115","volume":"8","author":"Y Zhang","year":"1998","unstructured":"Zhang, Y.: On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8(2), 365\u2013386 (1998)","journal-title":"SIAM J. Optim."},{"issue":"1\u20133","key":"696_CR2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1080\/10556789808805691","volume":"9","author":"FA Potra","year":"1998","unstructured":"Potra, F.A., Sheng, R.Q.: On homogeneous interior-point algorithms for semidefinite programming. Optim. Methods Softw. 9(1\u20133), 161\u2013184 (1998)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"696_CR3","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1137\/S1052623495294955","volume":"8","author":"FA Potra","year":"1998","unstructured":"Potra, F.A., Sheng, R.: A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming. SIAM J. Optim. 8(4), 1007\u20131028 (1998)","journal-title":"SIAM J. Optim."},{"key":"696_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/b105286","volume-title":"Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications","author":"E Klerk De","year":"2002","unstructured":"De Klerk, E.: Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands (2002)"},{"issue":"1","key":"696_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F Alizadeh","year":"2003","unstructured":"Alizadeh, F., Goldfard, D.: Second order cone optimization. Math. Program. 95(1), 3\u201351 (2003)","journal-title":"Math. Program."},{"issue":"4","key":"696_CR6","doi-asserted-by":"crossref","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."},{"key":"696_CR7","doi-asserted-by":"crossref","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, 331\u201335 (1997)","journal-title":"Positivity"},{"issue":"3","key":"696_CR8","doi-asserted-by":"crossref","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":"3","key":"696_CR9","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."},{"issue":"4","key":"696_CR10","doi-asserted-by":"crossref","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."},{"issue":"3","key":"696_CR11","doi-asserted-by":"crossref","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 primal-dual interior-point algorithms to symmetric cones. Math. Program. 96(3), 409\u2013438 (2003)","journal-title":"Math. Program."},{"issue":"3","key":"696_CR12","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1007\/s10957-012-0013-x","volume":"154","author":"GQ Wang","year":"2012","unstructured":"Wang, G.Q., Bai, Y.Q.: A new full Nesterov\u2013Todd step primal-dual path-following interior-point algorithm for symmetric optimization. J. Optim. Theory Appl. 154(3), 966\u2013985 (2012)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"696_CR13","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1007\/s10957-012-0018-5","volume":"154","author":"CH Liu","year":"2012","unstructured":"Liu, C.H., Liu, H.W., Liu, X.Z.: Polynomial convergence of second-order mehrotra type predictor\u2013corrector algorithms over symmetric cones. J. Optim. Theory Appl. 154(3), 949\u2013965 (2012)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"696_CR14","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1007\/s10957-013-0303-y","volume":"158","author":"HW Liu","year":"2013","unstructured":"Liu, H.W., Yang, X.M., Liu, C.H.: A new wide neighbourhood primal-dual infeasible-interior-point method for symmetric cone programming. J. Optim. Theory Appl. 158(3), 796\u2013815 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"696_CR15","doi-asserted-by":"crossref","unstructured":"Kheirfam, B.: A corrector\u2013predictor path-following method for convex quadratic symmetric cone optimization. J. Optim. Theory Appl. (2014). doi: 10.1007\/s10957-014-0554-2","DOI":"10.1007\/s10957-014-0554-2"},{"key":"696_CR16","doi-asserted-by":"crossref","unstructured":"Anjos, M.F., Lasserre, J.B.: Handbook on semidefinite, conic and polynomial optimization: theory, algorithms, software and applications. In: International Series in Operational Research and Management Science, Vol. 166. Springer, New York, USA (2012)","DOI":"10.1007\/978-1-4614-0769-0"},{"key":"696_CR17","unstructured":"Roos, C., Terlaky, T., Vial, J.-Ph.: Theory and Algorithms for Linear Optimization (1st Edition, Theory and Algorithms for Linear Optimization. An Interior-Point Approach. John Wiley & Sons, Chichester, UK, 1997). Springer, New York, USA (2005)"},{"issue":"4","key":"696_CR18","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1137\/050623917","volume":"16","author":"C Roos","year":"2006","unstructured":"Roos, C.: A full-Newton step $$O(n)$$ O ( n ) infeasible interior-point algorithm for linear optimization. SIAM J. Optim. 16(4), 1110\u20131136 (2006)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"696_CR19","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10957-009-9634-0","volume":"145","author":"G Gu","year":"2010","unstructured":"Gu, G., Mansouri, H., Zangiabadi, M., Bai, Y.Q., Roos, C.: Improved full-Newton step $$O(nL)$$ O ( n L ) infeasible interior-point method for linear optimization. J. Optim. Theory Appl. 145(2), 271\u2013288 (2010)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"696_CR20","first-page":"51","volume":"5","author":"Z Darvay","year":"2003","unstructured":"Darvay, Z.: New interior-point algorithms in linear programming. Adv. Model. Optim. 5(1), 51\u201392 (2003)","journal-title":"Adv. Model. Optim."},{"issue":"2","key":"696_CR21","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s11075-009-9270-7","volume":"52","author":"H Mansouri","year":"2009","unstructured":"Mansouri, H., Roos, C.: A new full-Newton step $$O(n)$$ O ( n ) infeasible interior-point algorithm for semidefinite optimization. Numer. Algorithms 52(2), 225\u2013255 (2009)","journal-title":"Numer. Algorithms"},{"issue":"5","key":"696_CR22","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.orl.2011.06.006","volume":"39","author":"LP Zhang","year":"2011","unstructured":"Zhang, L.P., Xu, Y.H.: A full-Newton step interior-point algorithm based on modified Newton direction. Oper. Res. Lett. 39(5), 318\u2013322 (2011)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"696_CR23","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1007\/s10957-013-0278-8","volume":"158","author":"M Zangiabadi","year":"2013","unstructured":"Zangiabadi, M., Gu, G., Roos, C.: Full Nesterov\u2013Todd step primal-dual interior-point methods for second-order cone optimization. J. Optim. Theory Appl. 158(3), 816\u2013858 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"696_CR24","doi-asserted-by":"crossref","unstructured":"Wang, G.Q., Bai, Y.Q., Gao, X.Y., Wang, D.Z.: Improved complexity analysis of full Nesterov\u2013Todd step interior-point methods for semidefinite optimization. J. Optim. Theory Appl. (2014). doi: 10.1007\/s10957-014-0619-2","DOI":"10.1007\/s10957-014-0619-2"},{"key":"696_CR25","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, New York (1994)"},{"issue":"1","key":"696_CR26","doi-asserted-by":"crossref","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":"8\u20139","key":"696_CR27","doi-asserted-by":"crossref","first-page":"1992","DOI":"10.1016\/j.laa.2008.11.015","volume":"430","author":"MS Gowda","year":"2009","unstructured":"Gowda, M.S., Tao, J., Moldovan, M.: Some inertia theorems in Euclidean Jordan algebras. Linear Alg. Appl. 430(8\u20139), 1992\u20132011 (2009)","journal-title":"Linear Alg. Appl."},{"issue":"3","key":"696_CR28","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1080\/10556780008805800","volume":"14","author":"ZQ Luo","year":"2000","unstructured":"Luo, Z.Q., Sturm, J.F., Zhang, Y.: Conic convex programming and self-dual embedding. Optim. Methods Softw. 14(3), 169\u2013218 (2000)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"696_CR29","doi-asserted-by":"crossref","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":"696_CR30","doi-asserted-by":"crossref","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."},{"issue":"3","key":"696_CR31","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1080\/10556788.2010.544877","volume":"27","author":"MVC Vieira","year":"2012","unstructured":"Vieira, M.V.C.: Interior-point methods based on kernel functions for symmetric optimization. Optim. Methods Softw. 27(3), 513\u2013537 (2012)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"696_CR32","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1007\/s10957-011-9938-8","volume":"152","author":"GQ Wang","year":"2012","unstructured":"Wang, G.Q., Bai, Y.Q.: A class of polynomial interior-point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones. J. Optim. Theory Appl. 152(3), 739\u2013772 (2012)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"696_CR33","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1080\/10556788.2013.781600","volume":"28","author":"GQ Wang","year":"2013","unstructured":"Wang, G.Q., Lesaja, G.: Full Nesterov\u2013Todd step feasible interior-point method for the Cartesian $$P_*(\\kappa )$$ P \u2217 ( \u03ba ) -SCLCP. Optim. Methods Softw. 28(3), 600\u2013618 (2013)","journal-title":"Optim. Methods Softw."}],"updated-by":[{"DOI":"10.1007\/s10957-016-1015-x","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2017,3,30]],"date-time":"2017-03-30T00:00:00Z","timestamp":1490832000000}}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-014-0696-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-014-0696-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-014-0696-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T18:31:28Z","timestamp":1717612288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-014-0696-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,17]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["696"],"URL":"https:\/\/doi.org\/10.1007\/s10957-014-0696-2","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,17]]}}}