Broyden–Fletcher–Goldfarb–Shanno algorithm

In numerical optimization, the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm is an iterative method for solving unconstrained nonlinear optimization problems. Like the related Davidon–Fletcher–Powell method, BFGS determines the descent direction by preconditioning the gradient with curvature information. It does so by gradually improving an approximation to the Hessian matrix of the loss function, obtained only from gradient evaluations (or approximate gradient evaluations) via a generalized secant method.

Since the updates of the BFGS curvature matrix do not require matrix inversion, its computational complexity is only $\mathcal(n^)$, compared to $\mathcal(n^)$ in Newton's method. Also in common use is L-BFGS, which is a limited-memory version of BFGS that is particularly suited to problems with very large numbers of variables (e.g., >1000). The BFGS-B variant handles simple box constraints.

The algorithm is named after Charles George Broyden, Roger Fletcher, Donald Goldfarb and David Shanno.

Rationale

The optimization problem is to minimize $f(\mathbf)$, where $\mathbf$ is a vector in $\mathbb^n$, and $f$ is a differentiable scalar function. There are no constraints on the values that $\mathbf$ can take.

The algorithm begins at an initial estimate for the optimal value $\mathbf_0$ and proceeds iteratively to get a better estimate at each stage.

The search direction p_''k'' at stage ''k'' is given by the solution of the analogue of the Newton equation:

:$B_k \mathbf_k = -\nabla f(\mathbf_k),$

where $B_k$ is an approximation to the Hessian matrix, which is updated iteratively at each stage, and $\nabla f(\mathbf_k)$ is the gradient of the function evaluated at x_''k''. A line search in the direction p_''k'' is then used to find the next point x_''k''+1 by minimizing $f(\mathbf_k + \gamma\mathbf_k)$ over the scalar $\gamma > 0.$

The quasi-Newton condition imposed on the update of $B_k$ is

:$B_ (\mathbf_ - \mathbf_k) = \nabla f(\mathbf_) - \nabla f(\mathbf_k).$

Let $\mathbf_k = \nabla f(\mathbf_) - \nabla f(\mathbf_k)$ and $\mathbf_k = \mathbf_ - \mathbf_k$, then $B_$ satisfies

:$B_ \mathbf_k = \mathbf_k$,

which is the secant equation.

The curvature condition $\mathbf_k^\top \mathbf_k > 0$ should be satisfied for $B_$ to be positive definite, which can be verified by pre-multiplying the secant equation with $\mathbf_k^T$. If the function is not strongly convex, then the condition has to be enforced explicitly e.g. by finding a point x_''k''+1 satisfying the Wolfe conditions, which entail the curvature condition, using line search.

Instead of requiring the full Hessian matrix at the point $\mathbf_$ to be computed as $B_$, the approximate Hessian at stage ''k'' is updated by the addition of two matrices:

:$B_ = B_k + U_k + V_k.$

Both $U_k$ and $V_k$ are symmetric rank-one matrices, but their sum is a rank-two update matrix. BFGS and DFP updating matrix both differ from its predecessor by a rank-two matrix. Another simpler rank-one method is known as symmetric rank-one method, which does not guarantee the positive definiteness. In order to maintain the symmetry and positive definiteness of $B_$, the update form can be chosen as $B_ = B_k + \alpha\mathbf\mathbf^\top + \beta\mathbf\mathbf^\top$. Imposing the secant condition, $B_ \mathbf_k = \mathbf_k$. Choosing $\mathbf = \mathbf_k$ and $\mathbf = B_k \mathbf_k$, we can obtain:

:$\alpha = \frac,$
:$\beta = -\frac.$

Finally, we substitute $\alpha$ and $\beta$ into $B_ = B_k + \alpha\mathbf\mathbf^\top + \beta\mathbf\mathbf^\top$ and get the update equation of $B_$:

:$B_ = B_k + \frac - \frac.$

Algorithm

From an initial guess $\mathbf_0$ and an approximate Hessian matrix $B_0$ the following steps are repeated as $\mathbf_k$ converges to the solution:
# Obtain a direction $\mathbf_k$ by solving $B_k \mathbf_k = -\nabla f(\mathbf_k)$.
# Perform a one-dimensional optimization ( line search) to find an acceptable stepsize $\alpha_k$ in the direction found in the first step. If an exact line search is performed, then $\alpha_k=\arg \min f(\mathbf_k+\alpha\mathbf_k)$ . In practice, an inexact line search usually suffices, with an acceptable $\alpha_k$ satisfying Wolfe conditions.
# Set $\mathbf_k = \alpha_k \mathbf_k$ and update $\mathbf_ = \mathbf_k + \mathbf_k$.
# $\mathbf_k =$.
# $B_ = B_k + \frac - \frac$.

$f(\mathbf)$ denotes the objective function to be minimized. Convergence can be checked by observing the norm of the gradient, $, , \nabla f(\mathbf_k), ,$. If $B_0$ is initialized with $B_0 = I$, the first step will be equivalent to a gradient descent, but further steps are more and more refined by $B_$, the approximation to the Hessian.

The first step of the algorithm is carried out using the inverse of the matrix $B_k$, which can be obtained efficiently by applying the Sherman–Morrison formula to the step 5 of the algorithm, giving

: $B_^ = \left(I - \frac \right) B_^ \left(I - \frac \right) + \frac.$

This can be computed efficiently without temporary matrices, recognizing that $B_k^$ is symmetric,
and that $\mathbf_k^ B_k^ \mathbf_k$ and $\mathbf_k^ \mathbf_k$ are scalars, using an expansion such as

: $B_^ = B_k^ + \frac - \frac.$

Therefore, in order to avoid any matrix inversion, the inverse of the Hessian can be approximated instead of the Hessian itself: $H_k \overset B_k^.$

From an initial guess $\mathbf_0$ and an approximate inverted Hessian matrix $H_0$ the following steps are repeated as $\mathbf_k$ converges to the solution:
# Obtain a direction $\mathbf_k$ by solving $\mathbf_k = -H_k \nabla f(\mathbf_k)$.
# Perform a one-dimensional optimization ( line search) to find an acceptable stepsize $\alpha_k$ in the direction found in the first step. If an exact line search is performed, then $\alpha_k=\arg \min f(\mathbf_k+\alpha\mathbf_k)$ . In practice, an inexact line search usually suffices, with an acceptable $\alpha_k$ satisfying Wolfe conditions.
# Set $\mathbf_k = \alpha_k \mathbf_k$ and update $\mathbf_ = \mathbf_k + \mathbf_k$.
# $\mathbf_k =$.
# $H_ = H_k + \frac - \frac$.

In statistical estimation problems (such as maximum likelihood or Bayesian inference), credible intervals or confidence intervals for the solution can be estimated from the inverse of the final Hessian matrix . However, these quantities are technically defined by the true Hessian matrix, and the BFGS approximation may not converge to the true Hessian matrix.

Notable implementations

Notable open source implementations are:

* ALGLIB implements BFGS and its limited-memory version in C++ and C#
* GNU Octave uses a form of BFGS in its fsolve function, with trust region extensions.
* The GSL implements BFGS as gsl_multimin_fdfminimizer_vector_bfgs2.
* In R, the BFGS algorithm (and the L-BFGS-B version that allows box constraints) is implemented as an option of the base function optim().
* In SciPy, the scipy.optimize.fmin_bfgs function implements BFGS. It is also possible to run BFGS using any of the L-BFGS algorithms by setting the parameter L to a very large number.
* In Julia, th
Optim.jl
package implements BFGS and L-BFGS as a solver option to the optimize() function (among other options).

Notable proprietary implementations include:

* The large scale nonlinear optimization software Artelys Knitro implements, among others, both BFGS and L-BFGS algorithms.
* In the MATLAB Optimization Toolbox, the fminunc function uses BFGS with cubic line search when the problem size is set to "medium scale."
* Mathematica includes BFGS.

See also

* BHHH algorithm
* Davidon–Fletcher–Powell formula
* Gradient descent
* L-BFGS
* Levenberg–Marquardt algorithm
* Nelder–Mead method
* Pattern search (optimization)
* Quasi-Newton methods
* Symmetric rank-one

References

Further reading

*
*
*
*
*

{{DEFAULTSORT:Broyden-Fletcher-Goldfarb-Shanno algorithm
Optimization algorithms and methods