A stabilization of the simplex method
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3167494 (Why is no real title available?)
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 862514 (Why is no real title available?)
- scientific article; zbMATH DE number 3276117 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Applications of Linear Programming to Numerical Analysis
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Computable Error Bounds for Direct Solution of Linear Equations
- Error Analysis of Direct Methods of Matrix Inversion
- Error control in the simplex-technique
- Techniques for automatic tolerance control in linear programming
Cited in
(29)- Large-scale linear programming: Geometry, working bases and factorizations
- The use of mass balances to test and improve the estimates of carbon fluxes in an ecosystem
- The double pivot simplex method
- An alternate implementation of Goldfarb's minimization algorithm
- Stable algorithm for updating denseLUfactorization after row or column exchange and row and column addition or deletion
- On error growth in the Bartels-Golub and Fletcher-Matthews algorithms for updating matrix factorizations
- On the Numerical Stability of Simplex-Algorithms
- A projective simplex algorithm using LU decomposition
- Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos
- A practicable steepest-edge simplex algorithm
- Symbiosis between linear algebra and optimization
- Solving staircase linear programs by the simplex method, 1: Inversion
- Stable modification of explicitLU factors for simplex updates
- Novel update techniques for the revised simplex method
- Large-scale linearly constrained optimization
- Assessing a set of additive utility functions for multicriteria decision- making, the UTA method
- On the Bartels—Golub decomposition for linear programming bases
- An implementation of the simplex method for linear programming problems with variable upper bounds
- The simplex method is not always well behaved
- A numerically stable form of the simplex algorithm
- Round-off estimates for second-order conic feasibility problems
- A phase-1 approach for the generalized simplex algorithm
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Sign consistent linear programming problems
- Hyper-sparsity in the revised simplex method and how to exploit it
- Solving second-order conic systems with variable precision
- Solving linear programs with finite precision. II: Algorithms
- Maintaining LU factors of a general sparse matrix
- A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems
This page was built for publication: A stabilization of the simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2540164)
