| Home | Trees | Indices | Help |
|---|
|
|
The :mod:`parsimony.algorithms.proximal` module contains several algorithms that involve proximal operators.
Algorithms may not store states. I.e., if they are classes, do not keep references to objects with state in the algorithm objects. It should be possible to copy and share algorithms between e.g. estimators, and thus they should not depend on any state.
Created on Mon Jun 2 15:42:13 2014
Copyright (c) 2013-2014, CEA/DSV/I2BM/Neurospin. All rights reserved.
Author: Tommy Löfstedt, Edouard Duchesnay, Fouad Hadj-Selem
License: BSD 3-clause.
|
|||
|
ISTA The iterative shrinkage-thresholding algorithm. |
|||
|
FISTA The fast iterative shrinkage-thresholding algorithm. |
|||
|
CONESTA COntinuation with NEsterov smoothing in a Soft-Thresholding Algorithm, or CONESTA for short. |
|||
|
StaticCONESTA COntinuation with NEsterov smoothing in a Soft-Thresholding Algorithm, or CONESTA for short, with a statically decreasing sequence of eps and mu. |
|||
|
ADMM The alternating direction method of multipliers (ADMM). |
|||
|
DykstrasProximalAlgorithm Dykstra's proximal algorithm. |
|||
|
DykstrasProjectionAlgorithm Dykstra's projection algorithm. |
|||
|
ParallelDykstrasProjectionAlgorithm Dykstra's projection algorithm for two or more functions. |
|||
|
ParallelDykstrasProximalAlgorithm Dykstra's projection algorithm for two or more functions. |
|||
|
|||
__package__ = |
|||
| Home | Trees | Indices | Help |
|---|
| Generated by Epydoc 3.0.1 on Mon Apr 6 23:52:10 2015 | http://epydoc.sourceforge.net |