OrgLion-ML
/
dlib
mirror of https://github.com/davisking/dlib.git
1
0
Fork 0
Code Issues Releases Wiki Activity

Minor cleanup 

--HG--
extra : convert_revision : svn%3Afdd8eb12-d10e-0410-9acb-85c331704f74/trunk%403217
This commit is contained in:
Davis King 2009-09-20 15:43:44 +00:00
parent 59409fb50d
commit 3e68d3e5cb
1 changed files with 2 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
examples/optimization_ex.cpp
View File

@ -1,8 +1,8 @@
// The contents of this file are in the public domain. See LICENSE_FOR_EXAMPLE_PROGRAMS.txt // The contents of this file are in the public domain. See LICENSE_FOR_EXAMPLE_PROGRAMS.txt
/* /*
This is an example illustrating the use the unconstrained optimization This is an example illustrating the use the optimization routines from
routines from the dlib C++ Library. the dlib C++ Library.
The library provides implementations of the conjugate gradient, The library provides implementations of the conjugate gradient,
BFGS, L-BFGS, and BOBYQA optimization algorithms. These algorithms allow BFGS, L-BFGS, and BOBYQA optimization algorithms. These algorithms allow
@ -213,8 +213,6 @@ int main()
// Finally, lets try the BOBYQA algorithm. This is a technique specially // Finally, lets try the BOBYQA algorithm. This is a technique specially
// designed to minimize a function in the absence of derivative information. // designed to minimize a function in the absence of derivative information.
// Generally speaking, it is the method of choice if derivatives are not available. // Generally speaking, it is the method of choice if derivatives are not available.
// For the details on what the parameters to this function represent see its documentation.
starting_point = -4,5,99,3; starting_point = -4,5,99,3;
find_min_bobyqa(test_function(target), find_min_bobyqa(test_function(target),
starting_point, starting_point,