On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty

We consider the iterative shrinkage/thresholding algorithm (ISTA) applied to a cost function composed of a data fidelity term and a penalty term. The penalty is nonconvex but the concavity of the penalty is accounted for by the data fidelity term so that the overall cost function is convex. We provi...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on signal processing Ročník 64; číslo 6; s. 1597 - 1608
Hlavný autor: Bayram, Ilker
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 15.03.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Acceleration
Convergence
Convex functions
Cost function
Forward backward splitting
Iterative algorithms
iterative shrinkage/thresholding
majorization minimization
Minimization
Signal processing algorithms
weakly convex
ISSN:1053-587X, 1941-0476
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We consider the iterative shrinkage/thresholding algorithm (ISTA) applied to a cost function composed of a data fidelity term and a penalty term. The penalty is nonconvex but the concavity of the penalty is accounted for by the data fidelity term so that the overall cost function is convex. We provide a generalization of the convergence result for ISTA viewed as a forward-backward splitting algorithm. We also demonstrate experimentally that for the current setup, using large stepsizes in ISTA can accelerate convergence more than existing schemes proposed for the convex case, like TwIST or FISTA.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2015.2502551