Abstract
We propose a new polynomial potential-reduction method for linear programming, which can also be seen as a large-step path-following method. We do an (approximate) linesearch along the Newton direction with respect to Renegar's strictly convex potential function if the iterate is far away from the central trajectory. If the iterate lies close to the trajectory, we update the lower bound for the optimal value. Dependent on this updating scheme, the iteration bound can be proved to be O( n L) or O( nL). Our method differs from the recently published potential-reduction methods in the choice of the potential function and the search direction.
Published Version
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.
