Author Topic: LBFGS  (Read 719 times)

0 Members and 1 Guest are viewing this topic.

Offline Jahanzaib

  • Heavy QuantumATK user
  • ***
  • Posts: 81
  • Country: gb
  • Reputation: 2
    • View Profile
LBFGS
« on: June 6, 2023, 00:25 »
Dear Expert
I have studied the LBFGS algorithms and found that during optimization it follow the following steps
•   Minimizing Forces
•   Compute the gradient
•   Update the search directions
•   Line search
•   Update the variables and memory history   
•   Check convergences

I am still confused about LBFGS the how this step could be explain mathematically, Expert please guide me a bit

Offline Anders Blom

  • QuantumATK Staff
  • Supreme QuantumATK Wizard
  • *****
  • Posts: 5405
  • Country: dk
  • Reputation: 89
    • View Profile
    • QuantumATK at Synopsys
Re: LBFGS
« Reply #1 on: June 6, 2023, 20:56 »
Maybe you already checked it out, but both https://en.wikipedia.org/wiki/Limited-memory_BFGS and https://stats.stackexchange.com/questions/284712/how-does-the-l-bfgs-work are very relevant. We use the Quasi-Newton approach, of course, snice we don't know the exact Hessian.