Low‐complexity minimization algorithms
From MaRDI portal
Publication:3599999
DOI10.1002/nla.449zbMath1164.65422MaRDI QIDQ3599999
Paolo Zellini, Stefano Fanelli, Carmine Di Fiore
Publication date: 9 February 2009
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2108/13874
performance; complexity; numerical examples; matrix algebra; unconstrained minimization; quasi-Newton method; updating algorithm; Broyden-Fletcher-Goldfarb-Shanno (BFGS) construction
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90C53: Methods of quasi-Newton type
65Y20: Complexity and performance of numerical algorithms
Related Items
Gradient-type methods: a unified perspective in computer science and numerical analysis, A new algorithm for box-constrained global optimization, A variation of Broyden class methods using Householder adaptive transforms, Adaptive matrix algebras in unconstrained minimization, Low complexity matrix projections preserving actions on vectors, Low complexity secant quasi-Newton minimization algorithms for nonconvex functions
Cites Work