From 3fa4c69e50fd572254be5d5fcdf722447ad6ab94 Mon Sep 17 00:00:00 2001
From: Davis King <davis@dlib.net>
Date: Sat, 12 May 2012 13:06:56 -0400
Subject: [PATCH] clarified docs

---
 docs/docs/optimization.xml | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/docs/docs/optimization.xml b/docs/docs/optimization.xml
index 13a124baf..53a4cfd67 100644
--- a/docs/docs/optimization.xml
+++ b/docs/docs/optimization.xml
@@ -620,7 +620,8 @@ However, for graphs with cycles, the solution may be approximate.
    Minimize: f(w) == 0.5*dot(w,w) + C*R(w)
 
    Where R(w) is a user-supplied convex function and C > 0.  Optionally,
-   this object can also add the non-negativity constraint that min(w) >= 0.
+   this object can also add non-negativity constraints to some or all
+   of the elements of w.
 </pre>
 <br/>
 <br/>