Home | Trees | Indices | Help |
---|
|
object --+ | bases.BaseAlgorithm --+ | bases.ExplicitAlgorithm --+ | object --+ | | | bases.IterativeAlgorithm --+ | object --+ | | | bases.InformationAlgorithm --+ | ExcessiveGapMethod
Nesterov's excessive gap method for strongly convex functions. Parameters ---------- output : Boolean. Whether or not to return extra output information. If output is True, running the algorithm will return a tuple with two elements. The first element is the found regression vector, and the second is the extra output information. eps : Positive float. Tolerance for the stopping criterion. info : List or tuple of utils.consts.Info. What, if any, extra run information should be stored. Default is an empty list, which means that no run information is computed nor returned. max_iter : Non-negative integer. Maximum allowed number of iterations. min_iter : Non-negative integer less than or equal to max_iter. Minimum number of iterations that must be performed. Default is 1.
|
|||
|
|||
|
|||
Inherited from Inherited from Inherited from Inherited from |
|
|||
Inherited from |
|
|||
INTERFACES =
|
|||
INFO_PROVIDED =
|
|||
__abstractmethods__ =
|
|||
_abc_negative_cache_version = 14
|
|||
Inherited from Inherited from |
|
|||
Inherited from |
|
x.__init__(...) initializes x; see help(type(x)) for signature
|
The excessive gap method for strongly convex functions. Parameters ---------- function : The function to minimise. It contains two parts, function.g is the strongly convex part and function.h is the smoothed part of the function. beta : Numpy array. A start vector. This is normally not given, but left None, since the start vector is computed by the algorithm.
|
|
INTERFACES
|
INFO_PROVIDED
|
Home | Trees | Indices | Help |
---|
Generated by Epydoc 3.0.1 on Mon Apr 6 23:52:10 2015 | http://epydoc.sourceforge.net |