A generalized homogeneous and self-dual algorithm for linear programming

DOI10.1016/0167-6377(95)00002-2zbMath0836.90119OpenAlexW2039245532MaRDI QIDQ1904760

Yinyu Ye, Xiaojie Xu

Publication date: 7 January 1996

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(95)00002-2

zbMATH Keywords

homogeneous and self-dual linear feasibility modelinfeasible-interior- point algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (1)

The practical behavior of the homogeneous self-dual formulations in interior point methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational experience with a primal-dual interior point method for linear programming
• A polynomial Newton method for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• A polynomial-time algorithm for a class of linear complementarity problems
• A primal-dual infeasible-interior-point algorithm for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• On the Implementation of a Primal-Dual Interior Point Method
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming
• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming

This page was built for publication: A generalized homogeneous and self-dual algorithm for linear programming