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
f6ad191c
Commit
f6ad191c
authored
Aug 01, 2015
by
Davis King
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Clarified spec
parent
0c561f2b
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
5 additions
and
4 deletions
+5
-4
optimization_trust_region_abstract.h
dlib/optimization/optimization_trust_region_abstract.h
+5
-4
No files found.
dlib/optimization/optimization_trust_region_abstract.h
View file @
f6ad191c
...
...
@@ -40,10 +40,11 @@ namespace dlib
Minimize: f(p) == 0.5*trans(p)*B*p + trans(g)*p
subject to the following constraint:
- length(p) <= radius
- returns the number of iterations performed. If this method fails to
converge to eps accuracy then the number returned will be max_iter+1.
- if this function returns 0 or 1 then we are not hitting the radius bound.
Otherwise, the radius constraint is active and std::abs(length(#p)-radius) <= eps.
- returns the number of iterations performed. If this method fails to converge
to eps accuracy then the number returned will be max_iter+1.
- if (this function didn't terminate due to hitting the max_iter iteration limit) then
- if this function returns 0 or 1 then we are not hitting the radius bound Otherwise,
the radius constraint is active and std::abs(length(#p)-radius)/radius <= eps.
!*/
// ----------------------------------------------------------------------------------------
...
...
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