Abstract
We present a modified and simplified version of an infeasible interior-point method for second-order cone optimization published in 2013 (Zangiabadi et al. in J Optim Theory Appl, 2013). In the earlier version, each iteration consisted of one so-called feasibility step and a few centering steps. Here, each iteration consists of only a feasibility step. Thus, the new algorithm improves the number of iterations and the improvement is due to a lemma which gives an upper bound for the proximity after the feasibility step. The complexity result coincides with the best-known iteration bound for infeasible interior-point methods.
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 callMore From: Journal of the Operations Research Society of China
Disclaimer: 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.
