inequality constrained quadratic program
c*vars >= r
PRE c
inequality constrained quadratic program
c*vars >= r PRE
c.dim() == dim ();
Section 13.3 This is a "projected gradient" algorithm. Starting from a point x
the next point is found in a direction determined by projecting
the gradient onto the active constraints. (well, not really the
gradient. The optimal solution obeying the active constraints is
tried. This is why H = Q^-1 in initialisation))
Vector constraint_solve(Vector)
Vector solve(Vector start)
int dim()
void add_inequality_cons(Vector c, double r)
Ineq_constrained_qp(int novars)
Real eval(Vector v)
Vector Ineq_constrained_qp::constraint_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