Luca Zanni

Luca Zanni

Auto-generated profile, based on publicly available information

Luca Zanni

Department of Physics, Informatics and Mathematics, University of Modena and Reggio Emilia, Modena, Italy

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 November 2008 in Inverse Problems
Verified
Journal Article
Closed access
SBS Bonettini
S Bonettini
RZR Zanella
R Zanella
LZL Zanni
L Zanni

1 January 2008 in Journal of Industrial and Management Optimization
Verified
Journal Article
Open access
PDF file
GFGiacomo Frassoldati
Giacomo Frassoldati
LZLuca Zanni
Luca Zanni
GZGaetano Zanghirati
Gaetano Zanghirati
This paper deals with gradient methods for minimizing $n$-dimen-sional strictly convex quadratic functions. Two new adaptive stepsize selection rules are presented and some key properties are proved. Practical insights on the effectiveness of the proposed techniques are given by a numerical comparison with the Barzilai-Borwein (BB) method, the cyclic/adaptive BB methods and two recent monotone gradient methods.

17 February 2009 in Inverse Problems
Verified
Journal Article
Closed access
RZR Zanella
R Zanella
PBP Boccacci
P Boccacci
LZL Zanni
L Zanni
MBM Bertero
M Bertero
Several methods based on different image models have been proposed and developed for image denoising. Some of them, such as total variation (TV) and wavelet thresholding, are based on the assumption of additive Gaussian noise. Recently the TV approach has been extended to the case of Poisson noise, a model describing the effect of photon counting in applications such as emission tomography, microscopy and astronomy. For the removal of this kind of noise we consider an approach based on a constrained optimization problem, with an objective function describing TV and other edge-preserving regularizations of the Kullback-Leibler divergence. We introduce a new discrepancy principle for the choice of the regularization parameter, which is justified by the statistical properties of the Poisson noise. For solving the optimization problem we propose a particular form of a general scaled gradient projection (SGP) method, recently introduced for image deblurring. We derive the form of the scaling from a decomposition of the gradient of the regularization functional into a positive and a negative part. The beneficial effect of the scaling is proved by means of numerical simulations, showing that the performance of the proposed form of SGP is superior to that of the most efficient gradient projection methods. An extended numerical analysis of the dependence of the solution on the regularization parameter is also performed to test the effectiveness of the proposed discrepancy principle.

26 August 2010 in Inverse Problems
Verified
Journal Article
Closed access
MBM Bertero
M Bertero
PBP Boccacci
P Boccacci
GTG Talenti
G Talenti
RZR Zanella
R Zanella
LZL Zanni
L Zanni

1 April 2003 in Parallel Computing
Verified
Journal Article
Closed access
GZG. Zanghirati
G. Zanghirati
LZL. Zanni
L. Zanni

1 April 2005 in Optimization Methods and Software
Verified
Journal Article
Closed access
TSThomas Serafini
Thomas Serafini
GZGaetano Zanghirati
Gaetano Zanghirati
LZLuca Zanni
Luca Zanni
Gradient projection methods based on the Barzilai–Borwein spectral steplength choices are considered for quadratic programming (QP) problems with simple constraints. Well-known nonmonotone spectral projected gradient methods and variable projection methods are discussed. For both approaches, the behavior of different combinations of the two spectral steplengths is investigated. A new adaptive steplength alternating rule is proposed, which becomes the basis for a generalized version of the variable projection method (GVPM). Convergence results are given for the proposed approach and its effectiveness is shown by means of an extensive computational study on several test problems, including the special quadratic programs arising in training support vector machines (SVMs). Finally, the GVPM behavior as inner QP solver in decomposition techniques for large-scale SVMs is also evaluated.