updated the docs

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

docs/docs/index.xml

@@ -114,6 +114,7 @@
                       <a href="optimization.html#lbfgs_search_strategy">L-BFGS</a> techniques</li>
                   <li>Box-constrained derivative-free optimization via the 
                       <a href="optimization.html#find_min_bobyqa">BOBYQA</a> algorithm</li> 
+                  <li>An implementation of the <a href="optimization.html#oca">Optimized Cutting Plane Algorithm</a></li> 
                   <li>A <a href="algorithms.html#bigint">big integer</a> object</li>
                   <li>A <a href="algorithms.html#rand">random number</a> object</li>
                </ul>

docs/docs/optimization.xml

@@ -12,7 +12,7 @@
          <p>
             This page documents library components that attempt to find the 
             minimum or maximum of a user supplied function.   An introduction
-            general purpose non-linear optimizers in this section can be
+            to the general purpose non-linear optimizers in this section can be
             found <a href="optimization_ex.cpp.html">here</a>.
          </p>
 
@@ -29,6 +29,7 @@
          <item>find_min_using_approximate_derivatives</item> 
          <item>find_min_bobyqa</item> 
          <item>solve_qp_using_smo</item> 
+         <item>oca</item> 
          <item>find_max</item> 
          <item>find_max_single_variable</item> 
          <item>find_max_using_approximate_derivatives</item> 
@@ -304,6 +305,37 @@
                                  
       </component>
 
+   <!-- ************************************************************************* -->
+      
+      <component>
+         <name>oca</name>
+         <file>dlib/optimization.h</file>
+         <spec_file link="true">dlib/optimization/optimization_oca_abstract.h</spec_file>
+         <description>
+                This object is a tool for solving the following optimization problem:   
+<pre>
+   Minimize: f(w) == 0.5*dot(w,w) + C*R(w)
+
+   Where R(w) is a convex function and C > 0
+</pre>
+<br/>
+<br/>
+
+                For a detailed discussion you should consult the following papers
+                from the Journal of Machine Learning Research:
+                <blockquote>
+                    Optimized Cutting Plane Algorithm for Large-Scale Risk Minimization
+                        Vojtech Franc, Soren Sonnenburg; 10(Oct):2157--2192, 2009. 
+                </blockquote>
+                <blockquote>
+                    Bundle Methods for Regularized Risk Minimization
+                        Choon Hui Teo, S.V.N. Vishwanthan, Alex J. Smola, Quoc V. Le; 11(Jan):311-365, 2010. 
+                </blockquote>
+
+         </description>
+                                 
+      </component>
+
    <!-- ************************************************************************* -->
       
       

docs/docs/term_index.xml

@@ -31,6 +31,7 @@
          <term file="dlib/optimization/optimization_abstract.h.html" name="line_search_funct"/>
          <term file="dlib/optimization/optimization_line_search_abstract.h.html" name="optimize_single_variable_failure"/>
          <term file="dlib/optimization/optimization_bobyqa_abstract.h.html" name="bobyqa_failure"/>
+         <term file="dlib/optimization/optimization_oca_abstract.h.html" name="oca_problem"/>
 
          <term file="optimization.html" name="derivative"/>
          <term file="optimization.html" name="make_line_search_function"/>
@@ -42,6 +43,7 @@
          <term file="optimization.html" name="find_min_using_approximate_derivatives"/>
          <term file="optimization.html" name="find_min_bobyqa"/>
          <term file="optimization.html" name="solve_qp_using_smo"/>
+         <term file="optimization.html" name="oca"/>
          <term link="optimization.html#find_min_bobyqa" name="BOBYQA"/>
          <term file="optimization.html" name="find_max"/>
          <term file="optimization.html" name="find_max_single_variable"/>