A quadratic programming view of the linear complementary problem

From MaRDI portal





This short paper gives two results on the relationships between linear complementary and quadratic programming problems. (1) A linear complementary problem can be solved by solving a quadratic programming problem. (2) A convex quadratic program can be solved by a linear complementary problem. A simple example is given to illustrate the second result.











This page was built for publication: A quadratic programming view of the linear complementary problem

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