A memoryless symmetric rank-one method with sufficient descent property for unconstrained optimization

Shummin Nakayama, Yasushi Narushima, Hiroshi Yabe

Research output: Contribution to journalArticle

3 Citations (Scopus)


Quasi-Newton methods are widely used for solving unconstrained optimization problems. However, it is difficult to apply quasi-Newton methods directly to large-scale unconstrained optimization problems, because they need the storage of memories for matrices. In order to overcome this difficulty, memoryless quasi-Newton methods were proposed. Shanno (1978) derived the memoryless BFGS method. Recently, several researchers studied the memoryless quasi-Newton method based on the symmetric rank-one formula. However existing memoryless symmetric rank-one methods do not necessarily satisfy the sufficient descent condition. In this paper, we focus on the symmetric rank-one formula based on the spectral scaling secant condition and derive a memoryless quasi-Newton method based on the formula. Moreover we show that the method always satisfies the sufficient descent condition and converges globally for general objective functions. Finally, preliminary numerical results are shown.

Original languageEnglish
Pages (from-to)53-70
Number of pages18
JournalJournal of the Operations Research Society of Japan
Issue number1
Publication statusPublished - 2018 Jan 1
Externally publishedYes



  • Memoryless quasi-Newton method
  • Nonlinear programming
  • Sufficient descent condition
  • Symmetric rank-one formula
  • Unconstrained optimization

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Management Science and Operations Research

Cite this