Highly Influential

@inproceedings{LaboratoryStephen2000OnRC, title={On Reduced Convex QP Formulations ofMonotone}, author={LaboratoryStephen and John Wright and LCP and ProblemsApril}, year={2000} }

- Published 2000

Techniques for transforming convex quadratic programs (QPs) into monotone linear complementarity problems (LCPs) and vice versa are well known. We describe a class of LCPs for which a reduced QP formulation|one that has fewer constraints than the \stan-dard" QP formulation|is available. We mention several instances of this class, including the known case in… CONTINUE READING

### Presentations referencing similar topics