Gradient methods are frequently used in large scale image deblurring problems since they avoid the onerous computation of the Hessian matrix of the objective function. Second order information is typically sought by a clever choice of the steplength parameter defining the descent direction, as in the case of the well-known Barzilai and Borwein rules. In a recent paper, a strategy for the steplength selection approximating the inverse of some eigenvalues of the Hessian matrix has been proposed for gradient methods applied to unconstrained minimization problems. In the quadratic case, this approach is based on a Lanczos process applied every m iterations to the matrix of the gradients computed in the previous m iterations, but the idea can be extended to a general objective function. In this paper we extend this rule to the case of scaled gradient projection methods applied to constrained minimization problems, and we test the effectiveness of the proposed strategy in image deblurring problems in both the presence and the absence of an explicit edge-preserving regularization term.

A new steplength selection for scaled gradient methods with application to image deblurring / Porta, Federica; Prato, Marco; Zanni, Luca. - In: JOURNAL OF SCIENTIFIC COMPUTING. - ISSN 0885-7474. - STAMPA. - 65:3(2015), pp. 895-919. [10.1007/s10915-015-9991-9]

A new steplength selection for scaled gradient methods with application to image deblurring

PORTA, FEDERICA;PRATO, Marco;ZANNI, Luca
2015

Abstract

Gradient methods are frequently used in large scale image deblurring problems since they avoid the onerous computation of the Hessian matrix of the objective function. Second order information is typically sought by a clever choice of the steplength parameter defining the descent direction, as in the case of the well-known Barzilai and Borwein rules. In a recent paper, a strategy for the steplength selection approximating the inverse of some eigenvalues of the Hessian matrix has been proposed for gradient methods applied to unconstrained minimization problems. In the quadratic case, this approach is based on a Lanczos process applied every m iterations to the matrix of the gradients computed in the previous m iterations, but the idea can be extended to a general objective function. In this paper we extend this rule to the case of scaled gradient projection methods applied to constrained minimization problems, and we test the effectiveness of the proposed strategy in image deblurring problems in both the presence and the absence of an explicit edge-preserving regularization term.
2015
65
3
895
919
A new steplength selection for scaled gradient methods with application to image deblurring / Porta, Federica; Prato, Marco; Zanni, Luca. - In: JOURNAL OF SCIENTIFIC COMPUTING. - ISSN 0885-7474. - STAMPA. - 65:3(2015), pp. 895-919. [10.1007/s10915-015-9991-9]
Porta, Federica; Prato, Marco; Zanni, Luca
File in questo prodotto:
File Dimensione Formato  
PratoNewHANDLE 11380-1061504.pdf

Open Access dal 02/02/2016

Tipologia: Versione dell'autore revisionata e accettata per la pubblicazione
Dimensione 697.18 kB
Formato Adobe PDF
697.18 kB Adobe PDF Visualizza/Apri
VOR_A New Steplength Selection for Scaled Gradient Methods.pdf

Accesso riservato

Tipologia: Versione pubblicata dall'editore
Dimensione 2.24 MB
Formato Adobe PDF
2.24 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1061504
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 24
  • ???jsp.display-item.citation.isi??? 22
social impact