Commit 3fa4c69e authored by Davis King's avatar Davis King

clarified docs

parent f91527a3
......@@ -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/>
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment