# Broyden family

### From Glossary

This is a family of algorithms to solve an unconstrained nonlinear program where the objective function is in ;. The algorithms in this family differ by how they update the approximation of the hessian inverse (assumed to exist). These are of the form:

with the two matrices being the Broyden-Fletcher-Goldfarb-Shanno update
(BFGS) and the Davidon-Fletcher-Powell update (DFP), respectively. If is in , this is called the *Broyden convex family*.