Quasi-Newton methods: Difference between revisions

From Cornell University Computational Optimization Open Textbook - Optimization Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 29: Line 29:
To illustrate the basic idea behind quasi-Newton methods, we start with building a quadratic model of the objective function at the current iterate  <math>x_k</math>:
To illustrate the basic idea behind quasi-Newton methods, we start with building a quadratic model of the objective function at the current iterate  <math>x_k</math>:


<math>m_k(p)=f_k+\bigtriangledown f_k^Tp+\frac{1}{2}p^TB_kp</math>  (1.1), where <math>B_k </math> is an <math>n\times n </math> symmetric positive definite matrix that will be updated at every iteration.
<math>m_k(p)=f_k+\bigtriangledown f_k^Tp+\frac{1}{2}p^TB_kp</math>  (1.1),  
 
where <math>B_k </math> is an <math>n\times n </math> symmetric positive definite matrix that will be updated at every iteration.


The minimizer of this convex quadratic model is:
The minimizer of this convex quadratic model is:


<math>p_k=-B_k^{-1}\bigtriangledown f_k </math>  (1.2), which is also used as the search direction.
<math>p_k=-B_k^{-1}\bigtriangledown f_k </math>  (1.2),  
 
which is also used as the search direction.


Then the new iterate could be written as: <math> x_{k+1}=x_{k}+\alpha _kp_k</math>  (1.3),  
Then the new iterate could be written as: <math> x_{k+1}=x_{k}+\alpha _kp_k</math>  (1.3),  
Line 52: Line 56:
<math>B_{k+1}\alpha _k p_k=\bigtriangledown f_{k+1}-\bigtriangledown f_k </math>  (1.6)
<math>B_{k+1}\alpha _k p_k=\bigtriangledown f_{k+1}-\bigtriangledown f_k </math>  (1.6)


Define <math> s_k=x_{k+1}-x_k</math>, <math> y_k=\bigtriangledown f_{k+1}-\bigtriangledown f_k</math> (1.7)
Define:
 
<math> s_k=x_{k+1}-x_k</math>, <math> y_k=\bigtriangledown f_{k+1}-\bigtriangledown f_k</math> (1.7)


So that (1.6) becomes: <math>B_{k+1}s_k=y_k </math>  (1.8), which is the '''secant equation.'''
So that (1.6) becomes: <math>B_{k+1}s_k=y_k </math>  (1.8), which is the '''secant equation.'''
Line 70: Line 76:
<math> G_k=[calculus]</math>
<math> G_k=[calculus]</math>


We skip the procedure of solving the minimization problem (1.10) and the unique solution of (1.10) is:
We skip procedures of solving the minimization problem (1.10) and here is the unique solution of (1.10):


<math> B_{k+1}=(I-\rho y_ks_k^T)B_k(I-\rho s_ky_k^T)+\rho y_ky_k^T</math>  (1.12)
<math> B_{k+1}=(I-\rho y_ks_k^T)B_k(I-\rho s_ky_k^T)+\rho y_ky_k^T</math>  (1.12)


<math>\rho=\frac{1}{y_k^Ts_k}</math>  (1.13)
where <math>\rho=\frac{1}{y_k^Ts_k}</math>  (1.13)


To get the inverse of <math>B_k</math>, we can apply Sherman-Morrison formula to avoid complicated calculation of inverse.


Set <math>H_k=B_k^{-1} </math>, with Sherman-Morrison formula we can get:
Set <math>H_k=B_k^{-1} </math>, with Sherman-Morrison formula we can get:


<math>H_{k+1}=H_k+\frac{s_k s_k^T}{s_k^T y_k}-\frac{H_k y_k y_k^T H_k}{y_k^T H_k y_k} </math>
<math>H_{k+1}=H_k+\frac{s_k s_k^T}{s_k^T y_k}-\frac{H_k y_k y_k^T H_k}{y_k^T H_k y_k} </math> (1.14)
 
 


In the DFP method, we use <math>B_k</math> to estimate the inverse of Hessian matrix
In the DFP method, we use <math>B_k</math> to estimate the inverse of Hessian matrix

Revision as of 13:34, 21 November 2020

Author: Jianmin Su (ChemE 6800 Fall 2020)

Steward: Allen Yang, Fengqi You

Quasi-Newton Methods are a kind of methods used to solve nonlinear optimization problems. They are based on Newton's method yet can be an alternative of Newton's method when the objective function is not twice-differentiable, which means the Hessian matrix is unavailable, or it is too expensive to calculate the Hessian matrix and its inverse.

Introduction

The first quasi-Newton algorithm was developed by W.C. Davidon in the mid1950s and it turned out to be a milestone in nonlinear optimization problems. He was trying to solve a long optimization calculation but he failed to get the result with the original method due to the low performances of computers at that time, thus he managed to build the quasi-Newton method to solve it. Later then, Fletcher and Powell proved that the new algorithm was more efficient and more reliable than the other existing methods.

During the following years, numerous variants were proposed, include Broyden's method (1965), the SR1 formula (Davidon 1959, Broyden 1967), the DFP method (Davidon, 1959; Fletcher and Powell, 1963), and the BFGS method (Broyden, 1969; Fletcher, 1970; Goldfarb, 1970; Shanno, 1970).

In optimization problems, Newton's method uses first and second derivatives, gradient and the Hessian in multivariate scenarios, to find the optimal point, it is applied to a twice-differentiable function to find the roots of the first derivative (solutions to ), also known as the stationary points of .

The iteration of Newton's method is usually written as: , where is the iteration number, is the Hessian matrix and

Iteraton would stop when it satisfies the convergence criteria like

Though we can solve an optimization problem quickly with Newton's method, it has two obvious disadvantages:

  1. The objective function must be twice-differentiable and the Hessian matrix must be positive definite.
  2. The calculation is costly because it requires to compute the Jacobian matrix, Hessian matrix and its inverse, which is time-consuming when dealing with a large-scale optimization problem.

However, we can use Quasi-Newton methods to avoid these two disadvantages.·


Quasi-Newton methods are similar to Newton's method but with one key idea that is different, they don't calculate the Hessian matrix, they introduce a matrix to estimate the Hessian matrix instead so that they can avoid the time-consuming calculations of Hessian matrix and its inverse. And there are many variants of quasi-Newton methods that simply depend on the exact methods they use in the estimation of the Hessian matrix.

Theory and Algorithm

To illustrate the basic idea behind quasi-Newton methods, we start with building a quadratic model of the objective function at the current iterate :

(1.1),

where is an symmetric positive definite matrix that will be updated at every iteration.

The minimizer of this convex quadratic model is:

(1.2),

which is also used as the search direction.

Then the new iterate could be written as: (1.3),

where is the step length that should satisfy the Wolfe conditions. The iteration is similar to Newton's method, but we use the approximate Hessian instead of the true Hessian.

To maintain the curve information we got from the previous iteration in , we generate a new iterate and new quadratic modelto in the form of:

(1.4).

To construct the relationship between 1.1 and 1.4, we require that in 1.1 at the function value and gradient match and , and the gradient of should match the gradient of the objective function at the latest two iterates and , then we can get:

(1.5)

and with some arrangements:

(1.6)

Define:

, (1.7)

So that (1.6) becomes: (1.8), which is the secant equation.

To make sure is still a symmetric positive definite matrix, we need (1.9).

To further preserve properties of and determine uniquely, we assume that among all symmetric matrices satisfying secant equation, is closest to the current matrix , which leads to a minimization problem:

(1.10) s.t. , ,

where and satisfy (1.9) and is symmetric and positive definite.

Different matrix norms applied in (1.10) results in different quasi-Newton methods. The weighted Frobenius norm can help us get an easy solution to the minimization problem: (1.11).

The weighted matrix can be any matrix that satisfies the relation ., where can be assumed as , is the mean Hessian defined by:

We skip procedures of solving the minimization problem (1.10) and here is the unique solution of (1.10):

(1.12)

where (1.13)

To get the inverse of , we can apply Sherman-Morrison formula to avoid complicated calculation of inverse.

Set , with Sherman-Morrison formula we can get:

(1.14)


In the DFP method, we use to estimate the inverse of Hessian matrix

In the BFGS method, we use to estimate the Hessian matrix


DFP Algorithm

  1. Given the starting point ; convergence tolerance ; the initial estimation of inverse Hessian matrix ; .
  2. Compute the search direction .
  3. Compute the step length with , and then set, then
  4. If , then end of the iteration, otherwise continue step5.
  5. Computing .
  6. Update the with
  7. Update with and go back to step2.

BFGS Algorithm

  1. Given the starting point ; convergence tolerance ; the initial estimation of Hessian matrix ; .
  2. Compute the search direction .
  3. Compute the step length with , and then set, then
  4. If , then end of the iteration, otherwise continue step5.
  5. Computing .
  6. Update the with
  7. Update with and go back to step2.

Numerical Example

Application

Conclusion

References