The implementation of linear programming algorithms based on homotopies

DOI10.1007/BF01961543zbMath0843.68038MaRDI QIDQ1911465

John Lawrence Nazareth

Publication date: 6 June 1996

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

homotopy-based linear programming algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (1)

Deriving potential functions via a symmetry principle for nonlinear equations

Uses Software

• tn
• UNCMND
• pchip
• LPKIT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational experience with a primal-dual interior point method for linear programming
• Homotopy techniques in linear programming
• Unified complexity analysis for Newton LP methods
• Todd's low-complexity algorithm is a predictor-corrector path-following method
• Maintaining LU factors of a general sparse matrix
• On the efficiency of algorithms of analysis
• Preconditioning of Truncated-Newton Methods
• The Homotopy Principle and Algorithms for Linear Programming
• On the Implementation of a Primal-Dual Interior Point Method
• A Polynomial-Time Predictor-Corrector Algorithm for a Class of Linear Complementarity Problems
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• Implementation aids for optimization algorithms that solve sequences of linear programs
• The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method

This page was built for publication: The implementation of linear programming algorithms based on homotopies