Pages that link to "Item:Q2558746"

The following pages link to A numerically stable form of the simplex algorithm (Q2558746):

Displaying 18 items.

• The sagitta method for solving linear programs (Q703904) (← links)
• A sparse counterpart of Reichel and Gragg's package QRUP (Q1044853) (← links)
• Variable metric methods for linearly constrained nonlinear minimax approximation (Q1051247) (← links)
• The simplex method is not always well behaved (Q1109528) (← links)
• Linear programming via least squares (Q1114313) (← links)
• DCR 2: An improved algorithm for \(\ell_\infty\) rational approximation on intervals (Q1136474) (← links)
• The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review (Q1312749) (← links)
• A perturbation analysis of the problem of downdating a Cholesky factorization (Q2365676) (← links)
• A modification to the LINPACK downdating algorithm (Q2639590) (← links)
• (Q3660803) (← links)
• Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
• Procedures for optimization problems with a mixture of bounds and general linear constraints (Q3675917) (← links)
• Stable modification of explicitLU factors for simplex updates (Q3692731) (← links)
• (Q3725888) (← links)
• On the Numerical Stability of Simplex-Algorithms (Q3768670) (← links)
• An implementation of the simplex method for linear programming problems with variable upper bounds (Q3934132) (← links)
• Newton-type methods for unconstrained and linearly constrained optimization (Q4051917) (← links)
• An Error Analysis of a Method for Solving Matrix Equations (Q4768552) (← links)