A MEMORYLESS SYMMETRIC RANK-ONE METHOD WITH SUFFICIENT DESCENT PROPERTY FOR UNCONSTRAINED OPTIMIZATION

DOI10.15807/jorsj.61.53zbMath1391.90493OpenAlexW2779205259MaRDI QIDQ4642056

Shummin Nakayama, Yasushi Narushima, Hiroshi Yabe

Publication date: 18 May 2018

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.61.53

zbMATH Keywords

unconstrained optimizationnonlinear programmingsufficient descent conditionmemoryless quasi-Newton methodsymmetric rank-one formula

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) 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 ⋮ 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 ⋮ A modified secant equation quasi-Newton method for unconstrained optimization ⋮ Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions

This page was built for publication: A MEMORYLESS SYMMETRIC RANK-ONE METHOD WITH SUFFICIENT DESCENT PROPERTY FOR UNCONSTRAINED OPTIMIZATION