Pages that link to "Item:Q2540164"
From MaRDI portal
The following pages link to A stabilization of the simplex method (Q2540164):
Displayed 29 items.
- Round-off estimates for second-order conic feasibility problems (Q447897) (← links)
- The double pivot simplex method (Q684156) (← links)
- The use of mass balances to test and improve the estimates of carbon fluxes in an ecosystem (Q1091311) (← links)
- On error growth in the Bartels-Golub and Fletcher-Matthews algorithms for updating matrix factorizations (Q1096336) (← links)
- The simplex method is not always well behaved (Q1109528) (← links)
- Assessing a set of additive utility functions for multicriteria decision- making, the UTA method (Q1162447) (← links)
- Symbiosis between linear algebra and optimization (Q1591197) (← links)
- A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
- Maintaining LU factors of a general sparse matrix (Q1822448) (← links)
- A projective simplex algorithm using LU decomposition (Q1975340) (← links)
- Solving second-order conic systems with variable precision (Q2340331) (← links)
- Novel update techniques for the revised simplex method (Q2352418) (← links)
- Hyper-sparsity in the revised simplex method and how to exploit it (Q2490370) (← links)
- Solving linear programs with finite precision. II: Algorithms (Q2496177) (← links)
- A numerically stable form of the simplex algorithm (Q2558746) (← links)
- A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems (Q2638951) (← links)
- Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos (Q3621498) (← links)
- Sign consistent linear programming problems (Q3648620) (← links)
- Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
- Stable modification of explicitLU factors for simplex updates (Q3692731) (← links)
- On the Numerical Stability of Simplex-Algorithms (Q3768670) (← links)
- A practicable steepest-edge simplex algorithm (Q3887219) (← links)
- An implementation of the simplex method for linear programming problems with variable upper bounds (Q3934132) (← links)
- Solving staircase linear programs by the simplex method, 1: Inversion (Q3948887) (← links)
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases (Q3955153) (← links)
- An alternate implementation of Goldfarb's minimization algorithm (Q4068458) (← links)
- On the Bartels—Golub decomposition for linear programming bases (Q4158808) (← links)
- Large-scale linearly constrained optimization (Q4162963) (← links)
- Stable algorithm for updating dense<i>LU</i>factorization after row or column exchange and row and column addition or deletion (Q4327873) (← links)