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

DOI10.1080/00207727408920083MaRDI QIDQ4051899zbMATH OpenOpenAlexFDO

Authors Martin A. Diamond

Publication date 1974

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quadratic programming (90C20)

Cites work

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

Cited in

(6)

• Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
• 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
• A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
• Iterative methods for linear complementarity problems with upperbounds on primary variables

This page was built for publication: The solution of a quadratic programming problem using fast methods to solve systems of linear equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4051899)