Guoqiang WangLingcheng Chen KongJiyuan TaoGoran LešajaTao, J.Y.Wang, G.Q.Kong, L.C.Lesaja, G.2025-10-06201700223239, 157328780022-32391573-287810.1007/s10957-016-1015-x2-s2.0-85016613654https://www.scopus.com/inward/record.uri?eid=2-s2.0-85016613654&doi=10.1007%2Fs10957-016-1015-x&partnerID=40&md5=9fa642b35372569625f285aeb7d13bf3https://gcris.yasar.edu.tr/handle/123456789/9657https://doi.org/10.1007/s10957-016-1015-xWe correct a typo in [1 Corollary 3.1] and an error in the proof of [1 Lemma 2.3]. © 2022 Elsevier B.V. All rights reserved.Englishinfo:eu-repo/semantics/openAccessSite Selection, Complexity Analysis, Euclidean Jordan Algebra, Full Nesterov–todd Step, Interior-point Method, Linear Optimization, Linear Optimization Over Symmetric Cone, Optimization Theory, Polynomial Complexity, Symmetric Cone, Symmetric Optimizations, Linear ProgrammingSite selection, Complexity analysis, Euclidean Jordan algebra, Full nesterov–todd step, Interior-point method, Linear optimization, Linear optimization over symmetric cone, Optimization theory, Polynomial complexity, Symmetric cone, Symmetric optimizations, Linear programmingErratum