Pages that link to "Item:Q4051899"
From MaRDI portal
The following pages link to The solution of a quadratic programming problem using fast methods to solve systems of linear equations (Q4051899):
Displaying 6 items.
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods (Q1090250) (← links)
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems (Q1154218) (← links)
- On the solution of large, structured linear complementarity problems: The tridiagonal case (Q1245772) (← links)
- On the solution of large, structured linear complementarity problems: the block partitioned case (Q1251591) (← links)
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines (Q1919811) (← links)
- Iterative methods for linear complementarity problems with upperbounds on primary variables (Q4744082) (← links)
