Skip to main content
Log in

On two homogeneous self-dual approaches to linear programming and its extensions

  • Published:
Mathematical Programming Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: July 1998 / Accepted: September 2000¶Published online November 17, 2000

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00011413