partial: 0.0.39-1.jcn

[lilypond.git] / src / qlpsolve.cc

diff --git a/src/qlpsolve.cc b/src/qlpsolve.cc
index ed49c2a02f8a5d2c6e3e0962a8a1f69dd78756ce..5738be2f3b0223c9236af8e481e72685f2f0bc17 100644 (file)
--- a/src/qlpsolve.cc
+++ b/src/qlpsolve.cc
@@ -133,7 +133,7 @@ Active_constraints::Active_constraints(Ineq_constrained_qp const *op)
     H=chol.inverse();
 }
 
-/* Find the optimum which is in the planes generated by the active
+/** Find the optimum which is in the planes generated by the active
     constraints.        
     */
 Vector
@@ -158,8 +158,8 @@ min_elt_index(Vector v)
     return idx;
 }
 
-///the numerical solving
-/** Mordecai Avriel, Nonlinear Programming: analysis and methods (1976)
+
+/**the numerical solving. Mordecai Avriel, Nonlinear Programming: analysis and methods (1976)
     Prentice Hall.
 
     Section 13.3
@@ -183,8 +183,9 @@ Ineq_constrained_qp::solve(Vector start) const
     
     Vector x(start);
     Vector gradient=quad*x+lin;
-
-
+//    Real fvalue = x*quad*x/2 + lin*x + const_term;
+// it's no use.
+    
     Vector last_gradient(gradient);
     int iterations=0;