Unmatched Preconditioning of the Proximal Gradient Algorithm

This work addresses the resolution of penalized least-squares problems using the proximal gradient algorithm (PGA). PGA can be accelerated by preconditioning strategies. However, typical effective choices of preconditioners may correspond to intricate matrices that are not easily inverted, leading t...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE signal processing letters Ročník 29; s. 1122 - 1126
Hlavní autori: Savanier, Marion, Chouzenoux, Emilie, Pesquet, Jean-Christophe, Riddell, Cyril
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Institute of Electrical and Electronics Engineers
Predmet:
ISSN:1070-9908, 1558-2361
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This work addresses the resolution of penalized least-squares problems using the proximal gradient algorithm (PGA). PGA can be accelerated by preconditioning strategies. However, typical effective choices of preconditioners may correspond to intricate matrices that are not easily inverted, leading to increased complexity in the computation of the proximity step. To relax these requirements, we propose an unmatched preconditioning approach where two metrics are used in the gradient step and the proximity step. We provide convergence conditions for this new iterative scheme and characterize its limit point. Simulations for tomographic image reconstruction from undersampled measurements show the benefits of our approach for various simple choices of metrics.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2022.3169088