updated docs

--HG--
extra : convert_revision : svn%3Afdd8eb12-d10e-0410-9acb-85c331704f74/trunk%404231

docs/docs/optimization.xml

@@ -49,6 +49,7 @@
          <item>solve_least_squares_lm</item> 
          <item>solve_trust_region_subproblem</item> 
          <item>max_cost_assignment</item> 
+         <item>max_sum_submatrix</item> 
       </section>
 
       <section>
@@ -445,6 +446,20 @@ subject to the following constraint:
                                  
       </component>
 
+   <!-- ************************************************************************* -->
+      
+      <component>
+         <name>max_sum_submatrix</name>
+         <file>dlib/optimization.h</file>
+         <spec_file link="true">dlib/optimization/max_sum_submatrix_abstract.h</spec_file>
+         <description>
+              This function finds the submatrix within a user supplied matrix which has the largest sum.  It then
+              zeros out that submatrix and repeats the process until no more maximal submatrices can 
+              be found.   
+         </description>
+                                 
+      </component>
+
    <!-- ************************************************************************* -->
       
       <component>

docs/docs/term_index.xml

@@ -44,6 +44,7 @@
          <term file="optimization.html" name="line_search"/>
          <term file="optimization.html" name="find_min"/>
          <term file="optimization.html" name="max_cost_assignment"/>
+         <term file="optimization.html" name="max_sum_submatrix"/>
          <term file="dlib/optimization/max_cost_assignment_abstract.h.html" name="assignment_cost"/>
          <term file="optimization.html" name="solve_least_squares"/>
          <term file="optimization.html" name="solve_least_squares_lm"/>