An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
type: Item
instance of: scholarly article
title: An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
zbMATH Open document ID: 0848.90088
DOI: 10.1007/BF02206822
author: Masakazu Muramatsu
author: Takashi Tsuchiya
published in: Annals of Operations Research
publication date: 1996-10-24T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 894989
zbMATH Keywords: global convergence
zbMATH Keywords: infeasible-interior-point algorithm
zbMATH Keywords: affine scaling algorithm
zbMATH Keywords: nondegeneracy assumption
MaRDI profile type: Publication
cites work: An implementation of Karmarkar's algorithm for linear programming
cites work: Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
cites work: Limiting behavior of the affine scaling continuous trajectories for linear programming problems
cites work: A combined phase I-phase II projective 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: Two-thirds is sharp for affine scaling
cites work: A new polynomial-time algorithm for linear programming
cites work: A primal-dual infeasible-interior-point algorithm for linear programming
cites work: A simplified global convergence proof of the affine scaling algorithm
cites work: A simple proof of a primal affine scaling method
cites work: Q4745213
cites work: On the convergence of the affine-scaling algorithm
cites work: Global convergence of the affine scaling methods for degenerate linear programming problems
cites work: Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
cites work: Superlinear convergence of the affine scaling algorithm
cites work: Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
cites work: A modification of Karmarkar's 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 894989