|
[Sponsors] |
April 28, 2021, 12:32 |
Problem in Adjoint based Optimization
|
#1 |
New Member
Omur Icke
Join Date: Apr 2016
Posts: 6
Rep Power: 10 |
Hello All,
I use the SLSQP method for an optimization problem having 1 objective with 1 constraint and 200 control points. As usual, at the first design (DSN001), it computes adjoints. After that, it only computes DIRECT solutions till 12th iteration. It looks like that there is no need to wait until 12th iteration, because it goes far from global min iteration by iteration. After 12th iteration it does not compute gradients until 23rd iteration similarly. I want to shorten this number if there is an option in SU2. I also checked the Fortran script that probably SU2 uses (https://github.com/scipy/scipy/blob/.../slsqp_optmz.f) In that script, line 454 give some idea about why it is like that. But I couldn't be sure. I really appreciate, if you could help me. Omur |
|
Tags |
adjointshapeoptimization, gradients, slsqp |
Thread Tools | Search this Thread |
Display Modes | |
|
|
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Unsteady shape optimization, Adjoint timestep restriction | Dilki | SU2 Shape Design | 2 | December 13, 2019 03:28 |
Adjoint FFD Wing optimization convergence controllers | StanislavKarpuk | SU2 | 0 | November 15, 2019 04:18 |
SU2 parallel optimization problem | n.d.ageev@gmail.com | SU2 | 4 | February 3, 2019 09:07 |
Airfoil Optimization With ANSYS Adjoint Solver | Nemo Sanchez | FLUENT | 3 | July 24, 2018 10:52 |
Airfoil Shape Optimization using gradient based methods | jaiswal | Main CFD Forum | 1 | April 10, 2014 11:22 |