Processing math: 100%
Gradient Methods and energy optimization
Contents
Overview
Brief reminder on Newton-Raphson's method
The equations
Simple geometric interpretation
Extending to more than one variable
Steepest descent
More on Steepest descent
The ideal
The sensitiveness of the gradient descent
Convex functions
Convex function
Conditions on convex functions
More on convex functions
Some simple problems
Standard steepest descent
Gradient method
Steepest descent method
Steepest descent method
Final expressions
Our simple
2
×
2
example
Derivatives and more
First a simple gradient descent solution
Implementing the steepest descent
Simple codes for steepest descent and conjugate gradient using a
2
×
2
matrix, in c++
The routine for the steepest descent method
Conjugate gradient method
Conjugate gradient method
Conjugate gradient method
Conjugate gradient method
Conjugate gradient method and iterations
Conjugate gradient method
Conjugate gradient method
Conjugate gradient method
Simple implementation of the Conjugate gradient algorithm
Broyden–Fletcher–Goldfarb–Shanno algorithm
Using gradient descent methods, limitations
Codes from numerical recipes
Finding the minimum of the harmonic oscillator model in one dimension
Functions to observe
Bringing back the full code from last week
General expression for the derivative of the energy
Python program for 2-electrons in 2 dimensions
Using Broyden's algorithm in scipy
Bringing back the full code from last week
«
1
...
33
34
35
36
37
38
39
40
41
42
43
44
»