Linear complementarity procedures in quadratic programming
From MaRDI portal
Recommendations
- A new algorithm for solving the general quadratic programming problem
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- A method for quadratic programming
- An implicit enumeration procedure for the general linear complementarity problem
- The complementary basis method for problems of convex quadratic programming
Cited in
(15)- General complementary pivot algorithm of quadratic programming and application in securities investment
- Quadratic programming problems and related linear complementarity problems
- scientific article; zbMATH DE number 3543799 (Why is no real title available?)
- scientific article; zbMATH DE number 4217201 (Why is no real title available?)
- Complementary Pivoting Algorithms Involving Extreme Rays
- Generalization of Murty's direct algorithm to linear and convex quadratic programming
- The complementary basis method for problems of convex quadratic programming
- A note on a quadratic formulation for linear complementarity problems
- A class of quadratic programs with linear complementarity constraints
- scientific article; zbMATH DE number 977754 (Why is no real title available?)
- A method of complementary basis for quadratic programming
- scientific article; zbMATH DE number 3920200 (Why is no real title available?)
- An implicit enumeration procedure for the general linear complementarity problem
- On convex quadratic programs with linear complementarity constraints
- A method for quadratic programming
This page was built for publication: Linear complementarity procedures in quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4973194)
