This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
optim:start [2020/08/25 15:46] 127.0.0.1 external edit |
optim:start [2022/03/25 11:48] (current) helene |
||
---|---|---|---|
Line 4: | Line 4: | ||
===== Objective ===== | ===== Objective ===== | ||
- | This optimization program allows the identification of the values of parameters likely to minimize an objective function representing the difference between two curves. The program will take a reference curve as an input (an experimental curve for instance) and will attempt to approach this curve with the finite element code Lagamine using different parameters obtained through the **Levenberg-Marquardt** algorithm. A schematic representation of th algorithm is shown in <imgref image1>. \\ \\ | + | This optimization program allows the identification of the values of parameters likely to minimize an objective function representing the difference between two curves. The program will take a reference curve as an input (an experimental curve for instance) and will attempt to approach this curve with the finite element code Lagamine using different parameters obtained through the **Levenberg-Marquardt** algorithm. A schematic representation of the algorithm is shown in <imgref image1>. \\ \\ |
<imgcaption image1|Optim algorithm>{{ :optim:optim_gen1.png?600 |}}</imgcaption> \\ | <imgcaption image1|Optim algorithm>{{ :optim:optim_gen1.png?600 |}}</imgcaption> \\ | ||
The optimization process is iterative and stops once a stop criterion is met, such as the stabilization of the objective function for instance. \\ | The optimization process is iterative and stops once a stop criterion is met, such as the stabilization of the objective function for instance. \\ |