The solution of a quadratic programming problem using fast methods to solve systems of linear equations

DOI10.1080/00207727408920083zbMath0297.90065OpenAlexW2158880971MaRDI QIDQ4051899

Martin A. Diamond

Publication date: 1974

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207727408920083

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items

Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods, A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines, A generalized conjugate gradient algorithm for solving a class of quadratic programming problems, On the solution of large, structured linear complementarity problems: The tridiagonal case, On the solution of large, structured linear complementarity problems: the block partitioned case, Iterative methods for linear complementarity problems with upperbounds on primary variables

Cites Work

• The Direct Solution of the Discrete Poisson Equation on a Rectangle