Abstract
In this paper, we give a new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming. Using the strategy, we improve the theoretical complexity bound of an infeasible-interior-point method. Convergence is shown for a commutative class of search directions, which includes the Nesterov---Todd direction and the $$xs$$xs and $$sx$$sx directions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
