The following pages link to (Q4283447):
Displaying 10 items.
- Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming (Q522098) (← links)
- Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods (Q665950) (← links)
- A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
- Applying steepest-edge techniques to a network primal-dual algorithm (Q1362969) (← links)
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (Q1765884) (← links)
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
- Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method (Q2244972) (← links)
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners (Q2356092) (← links)
- Superlinear convergence of the affine scaling algorithm (Q2365345) (← links)
- Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem. (Q5940720) (← links)
