@article{Goran_Wang_A. Oganian_2021, title={A Full Nesterov-Todd Step Infeasible Interior-point Method for Symmetric Optimization in the Wider Neighborhood of the Central Path}, volume={9}, url={http://iapress.org/index.php/soic/article/view/1175}, DOI={10.19139/soic-2310-5070-1175}, abstractNote={<p>In this paper, an improved Interior-Point Method (IPM) for solving symmetric optimization problems is presented. Symmetric optimization (SO) problems are linear optimization problems over symmetric cones. In particular, the method can be efficiently applied to an important instance of SO, a Controlled Tabular Adjustment (CTA) problem which is a method used for Statistical Disclosure Limitation (SDL) of tabular data. The presented method is a full Nesterov-Todd step infeasible IPM for SO. The algorithm converges to ε-approximate solution from any starting point whether feasible or infeasible. Each iteration consists of the feasibility step and several centering steps, however, the iterates are obtained in the wider neighborhood of the central path in comparison to the similar algorithms of this type which is the main improvement of the method. However, the currently best known iteration bound known for infeasible short-step methods is still achieved.</p>}, number={2}, journal={Statistics, Optimization & Information Computing}, author={Goran, Lesaja and Wang , G.Q. and A. Oganian}, year={2021}, month={Apr.}, pages={250-267} }