Steepest descent (gradient method) for quadratic functionLet the quadratic function

Kamren Franco

Kamren Franco

Answered question

2022-02-01

Steepest descent (gradient method) for quadratic function
Let the quadratic function F:RnR defined by:
F(x)=12Ax,xc,x,xRn
where A is a real symmetric positive definite (square) matrix, cRn.

Answer & Explanation

izumrledk

izumrledk

Beginner2022-02-02Added 15 answers

It holds Au=c, so the gradient expresses as
F(x)=Axc=A(xu)
The gradient update yields
u1=u0ρ0A(u0u)
For the given choice u0=u+αwm, this simplifies into
u1=u+αwmαρ0λmwm
By choosing the step size ρ0=1λm, the gradient descent method reaches the solution in one step!

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?