A method for quadratic programming
From MaRDI portal
Recommendations
- Linear complementarity procedures in quadratic programming
- The complementary basis method for problems of convex quadratic programming
- scientific article; zbMATH DE number 540120
- An approximate solution to linear and quadratic programming problems by the method of least squares
- An algorithm for solving quadratic programming problems
Cited in
(15)- The complementary basis method for problems of convex quadratic programming
- A method of complementary basis for quadratic programming
- An approximate solution to linear and quadratic programming problems by the method of least squares
- scientific article; zbMATH DE number 4018775 (Why is no real title available?)
- scientific article; zbMATH DE number 3848975 (Why is no real title available?)
- scientific article; zbMATH DE number 4217201 (Why is no real title available?)
- Minimization of total absolute deviation for a common due date
- scientific article; zbMATH DE number 3908174 (Why is no real title available?)
- scientific article; zbMATH DE number 3982921 (Why is no real title available?)
- Quadratic programming analogs
- A quadratic programming algorithm
- A decomposition method for quadratic programming
- scientific article; zbMATH DE number 1046860 (Why is no real title available?)
- scientific article; zbMATH DE number 3995473 (Why is no real title available?)
- Linear complementarity procedures in quadratic programming
This page was built for publication: A method for quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3026762)