A method to increase the computational efficiency of certain quadratic programming algorithms

DOI10.1007/BF02594785MaRDI QIDQ3959745zbMATH OpenFDO

Authors Michael J. Best, Richard J. Caron

Publication date 1983

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02594785

zbMATH Keywords

computation of Kuhn-Tucker multiplierscomputational efficiency improvement methodequality constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Cites work

• A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems
• A General Quadratic Programming Algorithm
• Numerically stable methods for quadratic programming

Cited in

(1)

• The simplex method and unrestricted variables

This page was built for publication: A method to increase the computational efficiency of certain quadratic programming algorithms

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