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
e302a61e
Commit
e302a61e
authored
Nov 25, 2017
by
Davis King
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Clarified spec
parent
89d3fe4e
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
10 additions
and
2 deletions
+10
-2
find_max_global_abstract.h
dlib/global_optimization/find_max_global_abstract.h
+10
-2
No files found.
dlib/global_optimization/find_max_global_abstract.h
View file @
e302a61e
...
@@ -114,7 +114,11 @@ namespace dlib
...
@@ -114,7 +114,11 @@ namespace dlib
elsewhere rather than on further improving the current local optima found so
elsewhere rather than on further improving the current local optima found so
far. That is, once a local maxima is identified to about solver_epsilon
far. That is, once a local maxima is identified to about solver_epsilon
accuracy, the algorithm will spend all its time exploring the functions to
accuracy, the algorithm will spend all its time exploring the functions to
find other local maxima to investigate.
find other local maxima to investigate. An epsilon of 0 means it will keep
solving until it reaches full floating point precision. Larger values will
cause it to switch to pure global exploration sooner and therefore might be
more effective if your objective function has many local maxima and you don't
care about a super high precision solution.
- find_max_global() runs until one of the following is true:
- find_max_global() runs until one of the following is true:
- The total number of calls to the provided functions is == num.max_calls
- The total number of calls to the provided functions is == num.max_calls
- More than max_runtime time has elapsed since the start of this function.
- More than max_runtime time has elapsed since the start of this function.
...
@@ -178,7 +182,11 @@ namespace dlib
...
@@ -178,7 +182,11 @@ namespace dlib
elsewhere rather than on further improving the current local optima found so
elsewhere rather than on further improving the current local optima found so
far. That is, once a local maxima is identified to about solver_epsilon
far. That is, once a local maxima is identified to about solver_epsilon
accuracy, the algorithm will spend all its time exploring the function to
accuracy, the algorithm will spend all its time exploring the function to
find other local maxima to investigate.
find other local maxima to investigate. An epsilon of 0 means it will keep
solving until it reaches full floating point precision. Larger values will
cause it to switch to pure global exploration sooner and therefore might be
more effective if your objective function has many local maxima and you don't
care about a super high precision solution.
- find_max_global() runs until one of the following is true:
- find_max_global() runs until one of the following is true:
- The total number of calls to f() is == num.max_calls
- The total number of calls to f() is == num.max_calls
- More than max_runtime time has elapsed since the start of this function.
- More than max_runtime time has elapsed since the start of this function.
...
...
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