Home | Trees | Indices | Help |
---|
|
Line searches: find minimum of a multivariate function. Optionnaly depends on scipy.optimize for some line searches. Available: - optimal step (exact minimum if Criterion is quadratic (only Norm2 norms)) - Backtracking : starts with optimal steps and reduces step until criterion decreases. if scipy.optimize is in PYTHONPATH: - LineSearch, LineSearchArmijo, LineSearchWolfe1; LineSearchWolfe2
|
|||
Backtracking | |||
LineSearch Wraps scipy.optimize.linesearch.line_search |
|||
LineSearchArmijo Wraps scipy.optimize.linesearch.line_search_armijo. |
|||
LineSearchWolfe1 Wraps scipy.optimize.linesearch.line_search_wolfe1 |
|||
LineSearchWolfe2 Wraps scipy.optimize.linesearch.line_search_wolfe2 |
|
|||
|
|
|||
__package__ =
|
|||
default_backtracking = <linear_operators.iterative.linesearch.
|
|
Finds quadratic optimal step of a criterion. Arguments ---------- algo: Algoritm instance with the following attributes: current_descent, current_gradient, criterion. The criterion attribute should be a Criterion instance with the following attributes: model, priors, hypers, norms. Returns ------- a: float The optimal step. |
|
default_backtracking
|
Home | Trees | Indices | Help |
---|
Generated by Epydoc 3.0.1 on Thu Jun 2 17:46:15 2011 | http://epydoc.sourceforge.net |