Pages that link to "Item:Q4019975"
From MaRDI portal
The following pages link to Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm (Q4019975):
Displaying 24 items.
- Sparsity preserving preconditioners for linear systems in interior-point methods (Q493682) (← links)
- Vector processing in simplex and interior methods for linear programming (Q751499) (← links)
- Making sparse matrices sparser: Computational results (Q751503) (← links)
- Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers (Q803714) (← links)
- Splitting dense columns in sparse linear systems (Q803727) (← links)
- George B. Dantzig and systems optimization (Q951088) (← links)
- Global convergence of the affine scaling methods for degenerate linear programming problems (Q1181905) (← links)
- Computational results of an interior point algorithm for large scale linear programming (Q1181915) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← links)
- A hierarchical algorithm for making sparse matrices sparser (Q1207308) (← links)
- A parallel interior point algorithm for linear programming on a network of transputers (Q1309858) (← links)
- Solving symmetric indefinite systems in an interior-point method for linear programming (Q1321659) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
- Efficient solution of two-stage stochastic linear programs using interior point methods (Q1803648) (← links)
- An implementation of Karmarkar's algorithm for linear programming (Q1824551) (← links)
- Presolving in linear programming (Q1914076) (← links)
- An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption (Q1915917) (← links)
- Superlinear convergence of the affine scaling algorithm (Q2365345) (← links)
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods (Q2643622) (← links)
- Exploiting hardware capabilities in interior point methods (Q2815515) (← links)
- An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)
- Interior-point methods for linear programming: a review (Q3150491) (← links)
- Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method (Q4389258) (← links)
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation (Q6166934) (← links)
