Gradient Search Cauchy Method

AnujaJoshi6 2,626 views 15 slides Oct 23, 2015
Slide 1
Slide 1 of 15
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10
Slide 11
11
Slide 12
12
Slide 13
13
Slide 14
14
Slide 15
15

About This Presentation

It is also known as Indirect search method or Steepest descent method,this method firstly found to Augustin Louis Cauchy in 1857.The method is used to solve optimization problems.


Slide Content

Gradient Search cauchy’s method Name- Anuja Joshi M.E(CADME) Roll no.- 561006

Multivariable optimization methods The multi-variable optimization methods deal with the optimization of multivariable design Similar to the single variable optimization , the multi- variable optimization methods are also classified into two categories:

Steps involved in Study Working Rules Procedural Steps Examples

Gradient based search method They are also known as Indirect search method or descent method

Direction of Gradient

Cauchy’s method(Steepest descent) Augustin Louis Cauchy, 1789–1857 Cauchy was the first to make a use of negative gradient direction in 1857 for minimization problem. In this method , an initial trial point X1 is chosen , which is iteratively move along the steepest descent direction until the optimum point

Working Rules Procedural Steps

Examples