Abstract
In this paper, we present a predictor-corrector path-following interior-point algorithm for symmetric cone optimization based on Darvay's technique. Each iteration of the algorithm contains a predictor step and a corrector step based on a modification of the Nesterov and Todd directions. Moreover, we show that the algorithm is well defined and that the obtained iteration bound is o(?rlogr?/?), where r is the rank of Euclidean Jordan algebra.
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.
