Mathematical Sciences: Faculty Presentations (1991-2022)
An Improved Feasible Full Nesterov-Todd Interior-Point Algorithm for Symmetric Optimization
Document Type
Presentation
Presentation Date
7-8-2015
Copyright
This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.
Abstract or Description
In this talk, an improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization is considered. Using several new results from Euclidean Jordan algebras and associated symmetric cones, a sharper quadratic convergence result than previously known is established, leading to a wider quadratic convergence neighborhood of the central path for the iterates in the algorithm. However, the best known iteration bound for full Nesterov-Todd step feasible interior-point methods is still achieved.
Sponsorship/Conference/Institution
EUROPT Workshop on Advances in Continuous Optimization
Location
Edinburgh, Scotland
Recommended Citation
Lesaja, Goran.
2015.
"An Improved Feasible Full Nesterov-Todd Interior-Point Algorithm for Symmetric Optimization."
Mathematical Sciences: Faculty Presentations (1991-2022).
Presentation 271.
https://digitalcommons.georgiasouthern.edu/math-sci-facpres/271
