Abstract.
We investigate the relation between interior-point algorithms applied to two homogeneous self-dual approaches to linear programming, one of which was proposed by Ye, Todd, and Mizuno and the other by Nesterov, Todd, and Ye. We obtain only a partial equivalence of path-following methods (the centering parameter for the first approach needs to be equal to zero or larger than one half), whereas complete equivalence of potential-reduction methods can be shown. The results extend to self-scaled conic programming and to semidefinite programming using the usual search directions.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: July 1998 / Accepted: September 2000¶Published online November 17, 2000
Rights and permissions
About this article
Cite this article
Mizuno, S., Todd, M. On two homogeneous self-dual approaches to linear programming and its extensions. Math. Program. 89, 517–534 (2001). https://doi.org/10.1007/PL00011413
Issue Date:
DOI: https://doi.org/10.1007/PL00011413