On the big \({\mathcal M}\) in the affine scaling algorithm
type: Item
instance of: scholarly article
title: On the big \({\mathcal M}\) in the affine scaling algorithm
zbMATH Open document ID: 0804.90088
DOI: 10.1007/BF01585161
author: Tohru Ishihara
author: Masakazu Kojima
published in: Mathematical Programming. Series A. Series B
publication date: 1994-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 558709
zbMATH Keywords: interior point algorithm
zbMATH Keywords: affine scaling algorithm
zbMATH Keywords: artificial linear program
MaRDI profile type: Publication
cites work: An implementation of Karmarkar's algorithm for linear programming
cites work: A variation on Karmarkar’s algorithm for solving linear programming problems
cites work: Q5583564
cites work: Q4187574
cites work: A new polynomial-time algorithm for linear programming
cites work: Q3491304
cites work: A little theorem of the big \({\mathcal M}\) in interior point algorithms
cites work: Q4206561
cites work: Global convergence of the affine scaling methods for degenerate linear programming problems
cites work: Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
cites work: Local Convergence Properties of New Methods in Linear Programming
cites work: Affine-scaling for linear programs with free variables
cites work: Q3351137
cites work: A modification of Karmarkar's linear programming algorithm
full work available at URL: https://doi.org/10.1007/bf01585161
OpenAlex ID: W2027245050
description: scientific article; zbMATH DE number 558709