Optimal Bounds for Solving Tridiagonal Systems with Preconditioning. - Paolo Zellini (SIAM J. Comput., 1988)

Matrix algebras in Quasi-Newton methods for unconstrained minimization. - Carmine Di Fiore; Stefano Fanelli; Filomena Lepore; Paolo Zellini (Numerische Mathematik, 2003)

A new class of quasi-Newtonian methods for optimal learning in MLP-networks. - Alessandro Bortoletti; Carmine Di Fiore; Stefano Fanelli; Paolo Zellini (IEEE Trans. Neural Networks, 2003)

An Efficient Generalization of Battiti-Shanno's Quasi-Newton Algorithm for Learning in MLP-Networks. - Carmine Di Fiore; Stefano Fanelli; Paolo Zellini (ICONIP, 2004)

Low-complexity minimization algorithms. - Carmine Di Fiore; Stefano Fanelli; Paolo Zellini (Numer. Linear Algebra Appl., 2005)

Regularizing properties of a class of matrices including the optimal and the superoptimal preconditioners. - Stefano Cipolla; Carmine Di Fiore; Fabio Durastante; Paolo Zellini (Numer. Linear Algebra Appl., 2019)

A variation of Broyden class methods using Householder adaptive transforms. - Stefano Cipolla; Carmine Di Fiore; Paolo Zellini (Comput. Optim. Appl., 2020)