Quadratic programming with mixed linear constraints
c*vars == r
PRE c
Quadratic programming with mixed linear constraints. problem definition of a quadratic optimisation problem with linear inequality and equality constraintsx^T QUAD x /2 + b^T x
c*vars == r
PRE c.dim()==dim ();
PRE
cons should be ascending
Vector Mixed_qp::solve(Vector start)
This program documentation comes from lilypond-1.0.0.tar.gz. It was generated by <janneke@gnu.org> on Fri Jul 31 15:42:17 CEST 1998