A modified layered-step interior-point algorithm for linear programming
type: Item
instance of: scholarly article
title: A modified layered-step interior-point algorithm for linear programming
zbMATH Open document ID: 0920.90098
DOI: 10.1007/BF01580074
author: Nimrod Megiddo
author: Shinji Mizuno
author: Takashi Tsuchiya
published in: Mathematical Programming. Series A. Series B
publication date: 1999-06-03T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1294676
zbMATH Keywords: path of centers
zbMATH Keywords: crossover events
zbMATH Keywords: layered-step interior-point algorithm
MaRDI profile type: Publication
cites work: A new polynomial-time algorithm for linear programming
cites work: A primal-dual interior point method whose running time depends only on the constraint matrix
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
cites work: A polynomial-time algorithm for a class of linear complementarity problems
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
cites work: Q3351137
cites work: A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
cites work: On scaled projections and pseudoinverses
cites work: Q4496017
cites work: A linear programming instance with many crossover events
cites work: Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
cites work: Triangular factors of modified matrices
cites work: Methods for Modifying Matrix Factorizations
description: scientific article; zbMATH DE number 1294676