Adaptive matrix algebras in unconstrained minimization

DOI10.1016/j.laa.2015.01.010zbMath1310.65061OpenAlexW1975879383MaRDI QIDQ2261561

Carmine Di Fiore, Paolo Zellini, Francesco Tudisco, Stefano Cipolla

Publication date: 6 March 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2015.01.010

zbMATH Keywords

global convergencematrix algebrasunconstrained minimizationquasi-Newton methodsiterative proceduresBroyden-Fletcher-Goldfarb-Shanno (BFGS) method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items

Low complexity matrix projections preserving actions on vectors, Regularization of inverse problems by an approximate matrix-function technique, A variation of Broyden class methods using Householder adaptive transforms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix algebras in quasi-Newton methods for unconstrained minimization
• Hartley-type algebras in displacement and optimization strategies.
• Low complexity secant quasi-Newton minimization algorithms for nonconvex functions
• Low‐complexity minimization algorithms
• Optimal and Superoptimal Circulant Preconditioners
• Quasi-Newton Methods, Motivation and Theory
• Numerical Optimization
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• Matrix algebras in optimal preconditioning