DQP

𝖦𝖠𝖫𝖠𝖧𝖠𝖣 DQP: solves strictly-convex quadratic programs using a dual gradient-projection method. The simplicity of the dual feasible region allows for fast iterative solution.