Skip to content
Projects
Groups
Snippets
Help
Loading...
Sign in
Toggle navigation
D
dlib
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
钟尚武
dlib
Commits
cc5d16d2
Commit
cc5d16d2
authored
Mar 20, 2017
by
Davis King
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
updated docs
parent
32455ed6
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
27 additions
and
0 deletions
+27
-0
optimization.xml
docs/docs/optimization.xml
+26
-0
term_index.xml
docs/docs/term_index.xml
+1
-0
No files found.
docs/docs/optimization.xml
View file @
cc5d16d2
...
...
@@ -44,6 +44,7 @@
<name>
Special Purpose Optimizers
</name>
<item>
find_gap_between_convex_hulls
</item>
<item>
solve_qp_box_constrained
</item>
<item>
solve_qp_box_constrained_blockdiag
</item>
<item>
solve_qp_using_smo
</item>
<item>
solve_qp2_using_smo
</item>
<item>
solve_qp3_using_smo
</item>
...
...
@@ -475,6 +476,31 @@ subject to the following constraint:
</component>
<!-- ************************************************************************* -->
<component>
<name>
solve_qp_box_constrained_blockdiag
</name>
<file>
dlib/optimization.h
</file>
<spec_file
link=
"true"
>
dlib/optimization/optimization_solve_qp_using_smo_abstract.h
</spec_file>
<description>
This function solves the following quadratic program:
<pre>
Minimize: f(alpha) == 0.5*trans(alpha)*Q*alpha + trans(b)*alpha
subject to the following box constraints on alpha:
0
<
= min(alpha-lower)
0
<
= max(upper-alpha)
Where f is convex. This means that Q should be positive-semidefinite.
</pre>
So it does the same thing as
<a
href=
"#solve_qp_box_constrained"
>
solve_qp_box_constrained
</a>
,
except it is optimized for large Q matrices with a special block
structure. In particular, Q must be grouped into identically sized
blocks where all blocks are diagonal matrices, except those on the
main diagonal which can be dense.
</description>
</component>
<!-- ************************************************************************* -->
<component>
...
...
docs/docs/term_index.xml
View file @
cc5d16d2
...
...
@@ -286,6 +286,7 @@
<term
file=
"optimization.html"
name=
"find_optimal_parameters"
include=
"dlib/optimization/find_optimal_parameters.h"
/>
<term
file=
"optimization.html"
name=
"elastic_net"
include=
"dlib/optimization/elastic_net.h"
/>
<term
file=
"optimization.html"
name=
"solve_qp_box_constrained"
include=
"dlib/optimization.h"
/>
<term
file=
"optimization.html"
name=
"solve_qp_box_constrained_blockdiag"
include=
"dlib/optimization.h"
/>
<term
file=
"optimization.html"
name=
"solve_qp_using_smo"
include=
"dlib/optimization.h"
/>
<term
file=
"optimization.html"
name=
"find_gap_between_convex_hulls"
include=
"dlib/optimization.h"
/>
<term
file=
"optimization.html"
name=
"solve_qp2_using_smo"
include=
"dlib/optimization.h"
/>
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment