Commit 0b16a785 authored by Davis King's avatar Davis King

updated docs

parent 46864890
......@@ -49,6 +49,7 @@
<item>solve_trust_region_subproblem</item>
<item>max_cost_assignment</item>
<item>max_sum_submatrix</item>
<item>find_map_nmplp</item>
</section>
<section>
......@@ -459,6 +460,34 @@ subject to the following constraint:
</component>
<!-- ************************************************************************* -->
<component>
<name>find_map_nmplp</name>
<file>dlib/optimization.h</file>
<spec_file link="true">dlib/optimization/find_map_nmplp_abstract.h</spec_file>
<description>
This function is a tool for approximately solving the MAP problem in a graphical
model or factor graph with pairwise potential functions. That is, it attempts
to solve a certain kind of optimization problem which can be defined as follows:
<pre>
maximize: f(X)
where X is a set of integer valued variables and f(X) can be written
as the sum of functions which each involve only two variables from X.
</pre>
<br/>
<br/>
This function is an implementation of the NMPLP algorithm introduced in the
following paper:
<blockquote>
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
by Amir Globerson Tommi Jaakkola
</blockquote>
</description>
</component>
<!-- ************************************************************************* -->
<component>
......
......@@ -55,6 +55,7 @@
<term file="optimization.html" name="solve_least_squares_lm"/>
<term file="optimization.html" name="find_min_trust_region"/>
<term file="optimization.html" name="find_max_trust_region"/>
<term file="optimization.html" name="find_map_nmplp"/>
<term file="optimization.html" name="solve_trust_region_subproblem"/>
<term file="optimization.html" name="find_min_single_variable"/>
<term file="optimization.html" name="find_min_using_approximate_derivatives"/>
......
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