A numerically stable form of the simplex algorithm

DOI10.1016/0024-3795(73)90047-5MaRDI QIDQ2558746zbMATH OpenOpenAlexFDO

Authors Philip E. Gill, Walter Murray

Publication date 1973

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(73)90047-5

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Cites work

• A stabilization of the simplex method
• scientific article; zbMATH DE number 3167494 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3490349 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• Quasi-Newton Methods for Unconstrained Optimization
• The Simplex Method for Quadratic Programming
• The simplex method of linear programming using LU decomposition
• Triangular factors of modified matrices

Cited in

(18)

• A sparse counterpart of Reichel and Gragg's package QRUP
• Variable metric methods for linearly constrained nonlinear minimax approximation
• The simplex method is not always well behaved
• Linear programming via least squares
• DCR 2: An improved algorithm for _ rational approximation on intervals
• The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
• A perturbation analysis of the problem of downdating a Cholesky factorization
• A modification to the LINPACK downdating algorithm
• scientific article; zbMATH DE number 3812856 (Why is no real title available?)
• Large-scale linear programming: Geometry, working bases and factorizations
• Procedures for optimization problems with a mixture of bounds and general linear constraints
• Stable modification of explicitLU factors for simplex updates
• scientific article; zbMATH DE number 3956831 (Why is no real title available?)
• On the Numerical Stability of Simplex-Algorithms
• An implementation of the simplex method for linear programming problems with variable upper bounds
• Newton-type methods for unconstrained and linearly constrained optimization
• An Error Analysis of a Method for Solving Matrix Equations
• The sagitta method for solving linear programs

This page was built for publication: A numerically stable form of the simplex algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2558746)