G. Q. WangL. C. KongJ. Y. TaoG. LesajaTao, J.Y.Wang, G.Q.Kong, L.C.Lesaja, G.2025-10-0620150022-32391573-287810.1007/s10957-014-0696-22-s2.0-84937939954http://dx.doi.org/10.1007/s10957-014-0696-2https://gcris.yasar.edu.tr/handle/123456789/7633https://doi.org/10.1007/s10957-014-0696-2In this paper an improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization is considered. Specifically we establish a sharper quadratic convergence result using several new results from Euclidean Jordan algebras which leads to a wider quadratic convergence neighbourhood of the central path for the iterates in the algorithm. Furthermore we derive the currently best known iteration bound for full Nesterov-Todd step feasible interior-point method.Englishinfo:eu-repo/semantics/closedAccessInterior-point methods, Euclidean Jordan algebras, Linear optimization over symmetric cones, Full Nesterov-Todd step, Polynomial complexityPOLYNOMIAL CONVERGENCE, ALGORITHMS, CONESPolynomial ComplexityEuclidean Jordan AlgebrasLinear Optimization over Symmetric ConesInterior-Point MethodsFull Nesterov–Todd StepFull Nesterov-Todd StepArticle