The following pages link to (Q4953319):
Displaying 18 items.
- Sparsity preserving preconditioners for linear systems in interior-point methods (Q493682) (← links)
- A projected-gradient interior-point algorithm for complementarity problems (Q634730) (← links)
- A least-squares minimum-cost network flow algorithm (Q646641) (← links)
- Accelerated multigrid for graph Laplacian operators (Q670780) (← links)
- Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems (Q895654) (← links)
- Inexact interior-point method (Q1384053) (← links)
- Symbiosis between linear algebra and optimization (Q1591197) (← links)
- A hybrid algorithm for the solution of a single commodity spatial equilibrium model (Q1919772) (← links)
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
- A fast first-order optimization approach to elastoplastic analysis of skeletal structures (Q2358083) (← links)
- Convergence analysis of an inexact potential reduction method for convex quadratic programming (Q2483035) (← links)
- Prim-based support-graph preconditioners for min-cost flow problems (Q2643617) (← links)
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods (Q2643622) (← links)
- Solving scalarized multi-objective network flow problems using an interior point method (Q3002548) (← links)
- Perturbed path following predictor-corrector interior point algorithms (Q4504781) (← links)
- Fortran subroutines for network flow optimization using an interior point algorithm (Q4905605) (← links)
- (Q5158552) (← links)
- Experiments with a hybrid interior point/combinatorial approach for network flow problems (Q5436921) (← links)
