A generalized homogeneous and self-dual algorithm for linear programming
type: Item
instance of: scholarly article
title: A generalized homogeneous and self-dual algorithm for linear programming
zbMATH Open document ID: 0836.90119
DOI: 10.1016/0167-6377(95)00002-2
author: Xiaojie Xu
author: Yinyu Ye
published in: Operations Research Letters
publication date: 1996-01-07T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 830187
zbMATH Keywords: homogeneous and self-dual linear feasibility model
zbMATH Keywords: infeasible-interior- point algorithm
MaRDI profile type: Publication
full work available at URL: 0167-6377(95)00002-2
OpenAlex ID: W2039245532
cites work: The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
cites work: A polynomial Newton method for linear programming
cites work: Q3236240
cites work: Q3491304
cites work: A polynomial-time algorithm for a class of linear complementarity problems
cites work: A primal-dual infeasible-interior-point algorithm for linear programming
cites work: Computational experience with a primal-dual interior point method for linear programming
cites work: Q4206561
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: Polynomiality of infeasible-interior-point algorithms for linear programming
cites work: A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
cites work: Q3236239
cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
description: scientific article; zbMATH DE number 830187