QP a general convex qpp solver

QP solves dense convex quadratic programming and supports ill conditionned problem

QP is a self contained quadratic programming solver based upon the well known Goldfarb Idnani algorithm. Hessian factorization and orthogonal transformation are used every where (Householder and givens rotation) it is necessary. When equality constraints exist, only the reduced Hessian is required to be positive definite. The full Hessian matrix is checked against a possibly very small negative eigenvalue due to rounding errors.

The calling sequence is similar to quadprog except that there is no starting point x0 argument. Option is limited to a tolerance tol and a maximum of iterations. The exitflag convention is maintained for >=0 value and is little bit different for <0 values. The output.status gives explanation as usually. A field .drop shows how many times a previously added constraint has been dropped.

Fixed variables are set through lb(*)=ub(*). Equality constraints may be linear dependent and they are checked against incompatibilty.

The cpu time is similar to quadprog and precision is usually better in particular for ill conditionned problem.

The package has been written with matlab R2018a however it does run successfully with many older releases.