Home | Trees | Indices | Help |
---|
|
object --+ | bases.BaseAlgorithm --+ | bases.ExplicitAlgorithm --+ | object --+ | | | bases.IterativeAlgorithm --+ | object --+ | | | bases.InformationAlgorithm --+ | MultiblockCONESTA
An alternating minimising multiblock algorithm that utilises CONESTA in the inner minimisation. Parameters ---------- 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. eps : Positive float. Tolerance for the stopping criterion. outer_iter : Non-negative integer. Maximum allowed number of outer loop iterations. max_iter : Non-negative integer. Maximum allowed number of iterations. min_iter : Non-negative integer. Number of required iterations. 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
|
This function obtains a minimiser of a give function. Parameters ---------- function : The function to minimise. x : A starting point.
|
|
INTERFACES
|
Home | Trees | Indices | Help |
---|
Generated by Epydoc 3.0.1 on Mon Apr 6 23:52:10 2015 | http://epydoc.sourceforge.net |