Abstract
In this paper, we propose a general path following method, in which the starting point can be any feasible interior pair and each iteration uses a step with the largest possible reduction in duality gap. The algorithm maintains the\(O (\sqrt n L)\) ineration complexity. It enjoys quadratic convergence if the optimal vertex is nondegenerate.
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.
