The implementation of linear programming algorithms based on homotopies
type: Item
instance of: scholarly article
title: The implementation of linear programming algorithms based on homotopies
zbMATH Open document ID: 0843.68038
DOI: 10.1007/BF01961543
author: J. L. Nazareth
published in: Algorithmica
publication date: 1996-06-06T00:00:00Z
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 871311
zbMATH Keywords: homotopy-based linear programming algorithm
describes a project that uses: UNCMND
describes a project that uses: tn
describes a project that uses: pchip
describes a project that uses: LPKIT
MaRDI profile type: Publication
cites work: Q4079613
cites work: Q3844775
cites work: Q3702408
cites work: A Polynomial-Time Predictor-Corrector Algorithm for a Class of Linear Complementarity Problems
cites work: Q3657778
cites work: Maintaining LU factors of a general sparse matrix
cites work: Q3359644
cites work: Q5538306
cites work: Q3997712
cites work: Q3491304
cites work: Computational experience with a primal-dual interior point method for linear programming
cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: Preconditioning of Truncated-Newton Methods
cites work: Homotopy techniques in linear programming
cites work: Implementation aids for optimization algorithms that solve sequences of linear programs
cites work: Q3786267
cites work: The Homotopy Principle and Algorithms for Linear Programming
cites work: Unified complexity analysis for Newton LP methods
cites work: On the efficiency of algorithms of analysis
cites work: The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method
cites work: Todd's low-complexity algorithm is a predictor-corrector path-following method
description: scientific article; zbMATH DE number 871311