Low‐complexity minimization algorithms

DOI10.1002/nla.449zbMath1164.65422OpenAlexW2063635964MaRDI 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

zbMATH Keywords

performancecomplexitynumerical examplesmatrix algebraunconstrained minimizationquasi-Newton methodupdating algorithmBroyden-Fletcher-Goldfarb-Shanno (BFGS) construction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Complexity and performance of numerical algorithms (65Y20)

Related Items (6)

Low complexity matrix projections preserving actions on vectors ⋮ Gradient-type methods: a unified perspective in computer science and numerical analysis ⋮ A new algorithm for box-constrained global optimization ⋮ Low complexity secant quasi-Newton minimization algorithms for nonconvex functions ⋮ Adaptive matrix algebras in unconstrained minimization ⋮ A variation of Broyden class methods using Householder adaptive transforms

Cites Work

• Numerical Optimization

This page was built for publication: Low‐complexity minimization algorithms