Memoryless quasi-Newton methods based on spectral-scaling Broyden family for unconstrained optimization

DOI10.3934/JIMO.2018122zbMath1438.90331OpenAlexW2887098792MaRDI QIDQ2315606

Shummin Nakayama, Yasushi Narushima, Hiroshi Yabe

Publication date: 25 July 2019

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2018122

zbMATH Keywords

unconstrained optimizationglobal convergenceBroyden familysufficient descent conditionmemoryless quasi-Newton method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items (5)

A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization ⋮ Inexact proximal DC Newton-type method for nonconvex composite functions ⋮ Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization ⋮ A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula ⋮ Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions

This page was built for publication: Memoryless quasi-Newton methods based on spectral-scaling Broyden family for unconstrained optimization