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
4fa32903
Commit
4fa32903
authored
Nov 26, 2017
by
Davis King
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
clarified docs
parent
4d0b2035
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
11 additions
and
12 deletions
+11
-12
optimization_ex.cpp
examples/optimization_ex.cpp
+11
-12
No files found.
examples/optimization_ex.cpp
View file @
4fa32903
...
@@ -263,20 +263,19 @@ int main() try
...
@@ -263,20 +263,19 @@ int main() try
// Finally, let's try the find_max_global() routine. Like
// Finally, let's try the find_max_global() routine. Like find_min_bobyqa(),
// find_max_bobyqa(), this is a technique specially designed to maximize
// this technique is specially designed to optimize a function in the absence
// a function in the absence of derivative information. However, it is
// of derivative information. However, it is also designed to handle
// also designed to handle functions with many local optima. Where
// functions with many local optima. Where BOBYQA would get stuck at the
// BOBYQA would get stuck at the nearest local optima, find_max_global()
// nearest local optima, find_max_global() won't. find_max_global() uses a
// won't. find_max_global() uses a global optimization method based on a
// global optimization method based on a combination of non-parametric global
// combination of non-parametric global function modeling and BOBYQA
// function modeling and BOBYQA style quadratic trust region modeling to
// style quadratic trust region modeling to efficiently find a global
// efficiently find a global maximizer. It usually does a good job with a
// maximizer. It usually does a good job with a relatively small number
// relatively small number of calls to the function being optimized.
// of calls to the function being optimized.
//
//
// You also don't have to give it a starting point or set any parameters,
// You also don't have to give it a starting point or set any parameters,
// other than defining
the bounds constraints. This makes it the method
// other than defining
bounds constraints. This makes it the method of
//
of choice for derivative free optimization in the presence of
local
//
choice for derivative free optimization in the presence of multiple
local
// optima. Its API also allows you to define functions that take a
// optima. Its API also allows you to define functions that take a
// column_vector as shown above or to explicitly use named doubles as
// column_vector as shown above or to explicitly use named doubles as
// arguments, which we do here.
// arguments, which we do here.
...
...
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