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

Replaced a funny character with the normal ASCII one. 

--HG--
extra : convert_revision : svn%3Afdd8eb12-d10e-0410-9acb-85c331704f74/trunk%403935
This commit is contained in:
Davis King 2010-12-02 23:49:07 +00:00
parent 81c0f74a48
commit 4ac5c193e4
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
dlib/optimization/optimization_least_squares_abstract.h
View File

@ -44,7 +44,7 @@ namespace dlib
- This function performs an unconstrained minimization of the least squares
function g(x) defined by:
- g(x) = sum over all i: 0.5*pow( f(list(i),x), 2 )
- This method combines the Levenberg–Marquardt method with a quasi-newton method
- This method combines the Levenberg-Marquardt method with a quasi-newton method
for approximating the second order terms of the hessian and is appropriate for
large residual problems (i.e. problems where the f() function isn't driven to 0).
In particular, it uses the method of Dennis, Gay, and Welsch as described in
@ -92,7 +92,7 @@ namespace dlib
- This function performs an unconstrained minimization of the least squares
function g(x) defined by:
- g(x) = sum over all i: 0.5*pow( f(list(i),x), 2 )
- This method implements a plain Levenberg–Marquardt approach for approximating
- This method implements a plain Levenberg-Marquardt approach for approximating
the hessian of g(). Therefore, it is most appropriate for small residual problems
(i.e. problems where f() goes to 0 at the solution).
- Since this is a trust region algorithm, the radius parameter defines the initial