Open Banana1530 opened 6 years ago
I notice there are two different versions of FISTA algorithm. To minimize g+h, where h is non-smooth and g smooth, FISTA update goes like this
where \beta_k is the momentum stepsize.
[1] uses
For the original paper [2]
where
[1] http://www.seas.ucla.edu/~vandenbe/236C/lectures/fista.pdf Page 3 [2] https://people.rennes.inria.fr/Cedric.Herzet/Cedric.Herzet/Sparse_Seminar/Entrees/2012/11/12_A_Fast_Iterative_Shrinkage-Thresholding_Algorithmfor_Linear_Inverse_Problems_(A._Beck,_M._Teboulle)_files/Breck_2009.pdf
I notice there are two different versions of FISTA algorithm. To minimize g+h, where h is non-smooth and g smooth, FISTA update goes like this
where \beta_k is the momentum stepsize.
[1] uses
For the original paper [2]
where
[1] http://www.seas.ucla.edu/~vandenbe/236C/lectures/fista.pdf Page 3 [2] https://people.rennes.inria.fr/Cedric.Herzet/Cedric.Herzet/Sparse_Seminar/Entrees/2012/11/12_A_Fast_Iterative_Shrinkage-Thresholding_Algorithmfor_Linear_Inverse_Problems_(A._Beck,_M._Teboulle)_files/Breck_2009.pdf