Pages that link to "Item:Q1824551"
From MaRDI portal
The following pages link to An implementation of Karmarkar's algorithm for linear programming (Q1824551):
Displayed 9 items.
- Midconvexity for finite sets (Q395816) (← links)
- Hopfield neural networks in large-scale linear optimization problems (Q428100) (← links)
- Dual interior point algorithms (Q647858) (← links)
- Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods (Q665950) (← links)
- An interior multiobjective linear programming algorithm (Q690014) (← links)
- Vector processing in simplex and interior methods for linear programming (Q751499) (← links)
- A unified view of interior point methods for linear programming (Q803041) (← links)
- Feasibility issues in a primal-dual interior-point method for linear programming (Q803044) (← links)
- Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers (Q803714) (← links)