# Difference between revisions of "Lbfgs.m"

From Spinach Documentation Wiki

m |
(→Arguments) |
||

(7 intermediate revisions by 2 users not shown) | |||

Line 1: | Line 1: | ||

{{DISPLAYTITLE:lbfgs.m}} | {{DISPLAYTITLE:lbfgs.m}} | ||

− | + | Calculates an approximation to the Newton-Raphson search direction using past gradients to build a serviceable substitute to a Hessian. The Hessian matrix is never explicitly formed or inverted. This function is the implementation from section 4 of http://dx.doi.org/10.1090/S0025-5718-1980-0572855-7 | |

− | |||

==Syntax== | ==Syntax== | ||

− | direction=lbfgs( | + | direction=lbfgs(dx_hist,dg_hist,g) |

− | |||

− | |||

− | |||

==Arguments== | ==Arguments== | ||

− | + | dx_hist - history of x increments, a stack | |

− | + | of column vectors, from the latest | |

− | + | to the earliest | |

− | |||

− | |||

− | + | dg_hist - history of gradient increments, | |

+ | a stack of column vectors, from | ||

+ | the latest to the earliest | ||

+ | |||

+ | g - current gradient | ||

− | == | + | ==Output== |

− | + | direction - LBFGS approximation to the | |

+ | search direction | ||

==Notes== | ==Notes== | ||

− | The L-BFGS algorithm is the default of [[fminnewton.m]], and | + | The L-BFGS algorithm is the default of [[fminnewton.m]], and is a good mix of computational efficiency and fast convergence. |

==See also== | ==See also== | ||

− | [[ | + | [[fminnewton.m]], [[hessreg.m]], [[linesearch.m]] |

− | '' | + | ''Version 2.2, authors: [[Ilya Kuprov]], [[David Goodwin]]'' |

## Latest revision as of 17:27, 13 August 2018

Calculates an approximation to the Newton-Raphson search direction using past gradients to build a serviceable substitute to a Hessian. The Hessian matrix is never explicitly formed or inverted. This function is the implementation from section 4 of http://dx.doi.org/10.1090/S0025-5718-1980-0572855-7

## Contents

## Syntax

direction=lbfgs(dx_hist,dg_hist,g)

## Arguments

dx_hist - history of x increments, a stack of column vectors, from the latest to the earliest dg_hist - history of gradient increments, a stack of column vectors, from the latest to the earliest g - current gradient

## Output

direction - LBFGS approximation to the search direction

## Notes

The L-BFGS algorithm is the default of fminnewton.m, and is a good mix of computational efficiency and fast convergence.

## See also

fminnewton.m, hessreg.m, linesearch.m

*Version 2.2, authors: Ilya Kuprov, David Goodwin*